./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 35987657 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-?-3598765 [2022-07-21 09:56:42,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:56:42,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:56:42,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:56:42,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:56:42,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:56:42,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:56:42,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:56:42,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:56:42,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:56:42,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:56:42,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:56:42,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:56:42,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:56:42,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:56:42,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:56:42,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:56:42,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:56:42,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:56:42,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:56:42,762 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:56:42,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:56:42,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:56:42,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:56:42,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:56:42,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:56:42,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:56:42,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:56:42,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:56:42,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:56:42,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:56:42,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:56:42,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:56:42,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:56:42,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:56:42,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:56:42,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:56:42,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:56:42,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:56:42,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:56:42,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:56:42,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:56:42,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:56:42,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:56:42,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:56:42,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:56:42,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:56:42,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:56:42,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:56:42,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:56:42,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:56:42,813 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:56:42,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:56:42,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:56:42,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:56:42,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:56:42,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:56:42,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:56:42,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:56:42,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:56:42,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:56:42,816 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:56:42,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:56:42,817 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-21 09:56:43,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:56:43,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:56:43,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:56:43,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:56:43,102 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:56:43,103 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-21 09:56:43,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86a9119/90ebba3503f442889b3553c732d13ff2/FLAGb0289359e [2022-07-21 09:56:43,725 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:56:43,725 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-21 09:56:43,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86a9119/90ebba3503f442889b3553c732d13ff2/FLAGb0289359e [2022-07-21 09:56:43,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86a9119/90ebba3503f442889b3553c732d13ff2 [2022-07-21 09:56:43,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:56:43,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:56:43,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:56:43,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:56:43,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:56:43,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:56:43" (1/1) ... [2022-07-21 09:56:43,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65611905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:43, skipping insertion in model container [2022-07-21 09:56:43,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:56:43" (1/1) ... [2022-07-21 09:56:43,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:56:44,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:56:44,967 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-21 09:56:44,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:56:45,029 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:56:45,212 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-21 09:56:45,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:56:45,336 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:56:45,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45 WrapperNode [2022-07-21 09:56:45,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:56:45,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:56:45,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:56:45,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:56:45,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,459 INFO L137 Inliner]: procedures = 133, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1375 [2022-07-21 09:56:45,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:56:45,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:56:45,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:56:45,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:56:45,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:56:45,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:56:45,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:56:45,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:56:45,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (1/1) ... [2022-07-21 09:56:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:56:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:45,623 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-21 09:56:45,634 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-21 09:56:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-21 09:56:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-21 09:56:45,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 09:56:45,648 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:56:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:56:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 09:56:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 09:56:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-21 09:56:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-21 09:56:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:56:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:56:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:56:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:56:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-21 09:56:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-21 09:56:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-21 09:56:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-21 09:56:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:56:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:56:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-21 09:56:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-21 09:56:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:56:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 09:56:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 09:56:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:56:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:56:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 09:56:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 09:56:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 09:56:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 09:56:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-21 09:56:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-21 09:56:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 09:56:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:56:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-21 09:56:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-21 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-21 09:56:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-21 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-21 09:56:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-21 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-21 09:56:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-21 09:56:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:56:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-21 09:56:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-21 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:56:45,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:56:45,654 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 09:56:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 09:56:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-21 09:56:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-21 09:56:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 09:56:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 09:56:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-21 09:56:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-21 09:56:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 09:56:45,655 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 09:56:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 09:56:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 09:56:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:56:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:56:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-21 09:56:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-21 09:56:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:56:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-21 09:56:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-21 09:56:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 09:56:45,657 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 09:56:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 09:56:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:56:45,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:56:45,890 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:56:45,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:56:46,146 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:56:46,255 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:56:47,650 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-21 09:56:47,650 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-21 09:56:47,672 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:56:47,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:56:47,689 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-21 09:56:47,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:47 BoogieIcfgContainer [2022-07-21 09:56:47,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:56:47,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:56:47,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:56:47,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:56:47,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:56:43" (1/3) ... [2022-07-21 09:56:47,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172a0ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:56:47, skipping insertion in model container [2022-07-21 09:56:47,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:45" (2/3) ... [2022-07-21 09:56:47,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172a0ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:56:47, skipping insertion in model container [2022-07-21 09:56:47,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:47" (3/3) ... [2022-07-21 09:56:47,699 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-21 09:56:47,709 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:56:47,709 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:56:47,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:56:47,781 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@2fb0357a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@231ca6c7 [2022-07-21 09:56:47,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:56:47,788 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-21 09:56:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 09:56:47,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:47,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:56:47,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-21 09:56:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:47,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128623954] [2022-07-21 09:56:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:47,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,221 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-21 09:56:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128623954] [2022-07-21 09:56:48,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128623954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:48,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:48,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:56:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047836704] [2022-07-21 09:56:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:48,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:56:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:56:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:56:48,254 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-21 09:56:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:48,357 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-21 09:56:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:56:48,359 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-21 09:56:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:48,373 INFO L225 Difference]: With dead ends: 1253 [2022-07-21 09:56:48,374 INFO L226 Difference]: Without dead ends: 824 [2022-07-21 09:56:48,379 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-21 09:56:48,381 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-21 09:56:48,382 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-21 09:56:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-21 09:56:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-21 09:56:48,467 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-21 09:56:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-21 09:56:48,478 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-21 09:56:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:48,479 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-21 09:56:48,479 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-21 09:56:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-21 09:56:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:56:48,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:48,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:56:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:56:48,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-21 09:56:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:48,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194844817] [2022-07-21 09:56:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,565 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-21 09:56:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:48,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194844817] [2022-07-21 09:56:48,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194844817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:48,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:48,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:56:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830102489] [2022-07-21 09:56:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:56:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:48,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:56:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:56:48,572 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-21 09:56:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:48,690 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-21 09:56:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:56:48,691 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-21 09:56:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:48,705 INFO L225 Difference]: With dead ends: 2433 [2022-07-21 09:56:48,706 INFO L226 Difference]: Without dead ends: 1617 [2022-07-21 09:56:48,709 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-21 09:56:48,711 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-21 09:56:48,711 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-21 09:56:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-21 09:56:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-21 09:56:48,777 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-21 09:56:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-21 09:56:48,791 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-21 09:56:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:48,792 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-21 09:56:48,792 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-21 09:56:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-21 09:56:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 09:56:48,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:48,795 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-21 09:56:48,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:56:48,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-21 09:56:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:48,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298844135] [2022-07-21 09:56:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:56:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:56:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:56:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:56:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:56:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 09:56:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:48,965 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-21 09:56:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:48,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298844135] [2022-07-21 09:56:48,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298844135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:48,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:48,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:56:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037292764] [2022-07-21 09:56:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:48,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:56:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:56:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:56:48,968 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-21 09:56:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:51,118 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2022-07-21 09:56:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:56:51,122 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-21 09:56:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:51,137 INFO L225 Difference]: With dead ends: 3324 [2022-07-21 09:56:51,137 INFO L226 Difference]: Without dead ends: 1722 [2022-07-21 09:56:51,146 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-21 09:56:51,146 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 235 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:51,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1966 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 09:56:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-07-21 09:56:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2022-07-21 09:56:51,230 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-21 09:56:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-21 09:56:51,247 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-21 09:56:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:51,248 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-21 09:56:51,248 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-21 09:56:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-21 09:56:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 09:56:51,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:51,256 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-21 09:56:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:56:51,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-21 09:56:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568454598] [2022-07-21 09:56:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:56:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:56:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:56:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:56:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:56:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 09:56:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:51,445 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-21 09:56:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568454598] [2022-07-21 09:56:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568454598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:51,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:51,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:56:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887819221] [2022-07-21 09:56:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:51,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:56:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:56:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:56:51,447 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-21 09:56:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:53,617 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2022-07-21 09:56:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:56:53,617 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-21 09:56:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:53,627 INFO L225 Difference]: With dead ends: 4036 [2022-07-21 09:56:53,628 INFO L226 Difference]: Without dead ends: 2437 [2022-07-21 09:56:53,632 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-21 09:56:53,633 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 437 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:53,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1375 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 09:56:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-21 09:56:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2022-07-21 09:56:53,742 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-21 09:56:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-21 09:56:53,753 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-21 09:56:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:53,753 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-21 09:56:53,754 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-21 09:56:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-21 09:56:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 09:56:53,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:53,756 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-21 09:56:53,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:56:53,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-21 09:56:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852847501] [2022-07-21 09:56:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:56:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:56:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:56:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:56:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,898 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-21 09:56:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:53,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852847501] [2022-07-21 09:56:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852847501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:53,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:53,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:56:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310924286] [2022-07-21 09:56:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:56:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:56:53,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:56:53,901 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-21 09:56:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:54,777 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2022-07-21 09:56:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:56:54,777 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-21 09:56:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:54,794 INFO L225 Difference]: With dead ends: 6341 [2022-07-21 09:56:54,794 INFO L226 Difference]: Without dead ends: 4040 [2022-07-21 09:56:54,799 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-21 09:56:54,800 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 564 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:54,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2613 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 09:56:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-07-21 09:56:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2022-07-21 09:56:54,887 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-21 09:56:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2022-07-21 09:56:54,894 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2022-07-21 09:56:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:54,894 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2022-07-21 09:56:54,894 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-21 09:56:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2022-07-21 09:56:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:56:54,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:54,897 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-21 09:56:54,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:56:54,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-21 09:56:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779057433] [2022-07-21 09:56:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:56:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:56:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:55,047 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-21 09:56:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779057433] [2022-07-21 09:56:55,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779057433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:55,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:55,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:56:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702776076] [2022-07-21 09:56:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:55,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:56:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:56:55,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:56:55,050 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-21 09:56:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:55,864 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2022-07-21 09:56:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:56:55,864 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-21 09:56:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:55,879 INFO L225 Difference]: With dead ends: 5919 [2022-07-21 09:56:55,880 INFO L226 Difference]: Without dead ends: 3584 [2022-07-21 09:56:55,886 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-21 09:56:55,888 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 453 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:55,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2491 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 09:56:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2022-07-21 09:56:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2022-07-21 09:56:55,979 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-21 09:56:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2022-07-21 09:56:55,985 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2022-07-21 09:56:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:55,986 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2022-07-21 09:56:55,986 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-21 09:56:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2022-07-21 09:56:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:56:55,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:55,988 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-21 09:56:55,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:56:55,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-21 09:56:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:55,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556744495] [2022-07-21 09:56:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:56:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:56:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,226 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-21 09:56:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:56,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556744495] [2022-07-21 09:56:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556744495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:56:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023158146] [2022-07-21 09:56:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:56,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:56:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:56:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:56:56,228 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-21 09:56:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:57,306 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2022-07-21 09:56:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:56:57,307 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-21 09:56:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:57,316 INFO L225 Difference]: With dead ends: 3619 [2022-07-21 09:56:57,316 INFO L226 Difference]: Without dead ends: 2425 [2022-07-21 09:56:57,319 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-21 09:56:57,321 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 117 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2836 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-21 09:56:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 2836 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:56:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-07-21 09:56:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2022-07-21 09:56:57,392 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-21 09:56:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-21 09:56:57,398 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-21 09:56:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:57,399 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-21 09:56:57,400 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-21 09:56:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-21 09:56:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:56:57,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:57,401 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-21 09:56:57,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:56:57,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-21 09:56:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:57,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377196572] [2022-07-21 09:56:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:56:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:56:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:57,612 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-21 09:56:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377196572] [2022-07-21 09:56:57,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377196572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:57,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:57,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 09:56:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114389384] [2022-07-21 09:56:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:57,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:56:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:56:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:56:57,615 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-21 09:56:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:58,978 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2022-07-21 09:56:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:56:58,978 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-21 09:56:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:58,991 INFO L225 Difference]: With dead ends: 5577 [2022-07-21 09:56:58,991 INFO L226 Difference]: Without dead ends: 3212 [2022-07-21 09:56:58,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:56:58,997 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 448 mSDsluCounter, 5516 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 6427 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:58,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 6427 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 09:56:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-07-21 09:56:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2022-07-21 09:56:59,109 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-21 09:56:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-21 09:56:59,116 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-21 09:56:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:59,116 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-21 09:56:59,117 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-21 09:56:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-21 09:56:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:56:59,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:59,118 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-21 09:56:59,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:56:59,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2022-07-21 09:56:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018287728] [2022-07-21 09:56:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:56:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:56:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,277 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-21 09:56:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:59,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018287728] [2022-07-21 09:56:59,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018287728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:59,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:59,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:56:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151970310] [2022-07-21 09:56:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:56:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:56:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:56:59,280 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 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-21 09:57:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:00,409 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2022-07-21 09:57:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 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-21 09:57:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:00,423 INFO L225 Difference]: With dead ends: 5739 [2022-07-21 09:57:00,424 INFO L226 Difference]: Without dead ends: 3370 [2022-07-21 09:57:00,428 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-21 09:57:00,429 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 397 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 3671 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:00,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 3671 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 09:57:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-21 09:57:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2022-07-21 09:57:00,508 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-21 09:57:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2022-07-21 09:57:00,513 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2022-07-21 09:57:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:00,514 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2022-07-21 09:57:00,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 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-21 09:57:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2022-07-21 09:57:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:57:00,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:00,516 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-21 09:57:00,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:57:00,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-21 09:57:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:00,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19213341] [2022-07-21 09:57:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,660 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-21 09:57:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19213341] [2022-07-21 09:57:00,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19213341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:00,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:00,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:57:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976801656] [2022-07-21 09:57:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:00,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:57:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:57:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:00,662 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-21 09:57:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:02,613 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2022-07-21 09:57:02,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:57:02,614 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-21 09:57:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:02,626 INFO L225 Difference]: With dead ends: 3452 [2022-07-21 09:57:02,627 INFO L226 Difference]: Without dead ends: 3447 [2022-07-21 09:57:02,628 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-21 09:57:02,628 INFO L413 NwaCegarLoop]: 919 mSDtfsCounter, 2406 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:02,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 2311 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 09:57:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-07-21 09:57:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2022-07-21 09:57:02,728 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-21 09:57:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2022-07-21 09:57:02,735 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2022-07-21 09:57:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:02,736 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2022-07-21 09:57:02,736 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-21 09:57:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2022-07-21 09:57:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:57:02,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:02,738 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-21 09:57:02,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 09:57:02,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2022-07-21 09:57:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021976014] [2022-07-21 09:57:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:57:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:57:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:02,988 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-21 09:57:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021976014] [2022-07-21 09:57:02,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021976014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:02,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:02,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:57:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320191875] [2022-07-21 09:57:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:57:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:57:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:02,990 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-21 09:57:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:04,084 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2022-07-21 09:57:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:57:04,085 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-21 09:57:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:04,103 INFO L225 Difference]: With dead ends: 7643 [2022-07-21 09:57:04,103 INFO L226 Difference]: Without dead ends: 4292 [2022-07-21 09:57:04,111 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-21 09:57:04,111 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 599 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2766 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-21 09:57:04,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2766 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:57:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-07-21 09:57:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2022-07-21 09:57:04,276 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-21 09:57:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2022-07-21 09:57:04,282 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2022-07-21 09:57:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:04,282 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2022-07-21 09:57:04,282 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-21 09:57:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2022-07-21 09:57:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-21 09:57:04,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:04,285 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-21 09:57:04,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 09:57:04,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2022-07-21 09:57:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:04,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000898556] [2022-07-21 09:57:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:57:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:57:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:57:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:57:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:04,495 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-21 09:57:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:04,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000898556] [2022-07-21 09:57:04,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000898556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:04,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:04,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 09:57:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107538262] [2022-07-21 09:57:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:57:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:04,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:57:04,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:04,497 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-21 09:57:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:06,253 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2022-07-21 09:57:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:06,254 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-21 09:57:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:06,263 INFO L225 Difference]: With dead ends: 6776 [2022-07-21 09:57:06,264 INFO L226 Difference]: Without dead ends: 4370 [2022-07-21 09:57:06,268 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-21 09:57:06,268 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 433 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 5904 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:06,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 5904 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 09:57:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2022-07-21 09:57:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2022-07-21 09:57:06,377 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-21 09:57:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2022-07-21 09:57:06,384 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2022-07-21 09:57:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:06,385 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2022-07-21 09:57:06,385 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-21 09:57:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2022-07-21 09:57:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:57:06,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:06,387 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-21 09:57:06,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 09:57:06,387 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-21 09:57:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585778568] [2022-07-21 09:57:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:57:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:06,552 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-21 09:57:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:06,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585778568] [2022-07-21 09:57:06,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585778568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:06,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694326049] [2022-07-21 09:57:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:06,554 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-21 09:57:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:07,552 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2022-07-21 09:57:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:57:07,552 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-21 09:57:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:07,562 INFO L225 Difference]: With dead ends: 6262 [2022-07-21 09:57:07,562 INFO L226 Difference]: Without dead ends: 3856 [2022-07-21 09:57:07,568 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-21 09:57:07,569 INFO L413 NwaCegarLoop]: 806 mSDtfsCounter, 513 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:07,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 2794 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 09:57:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-07-21 09:57:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2022-07-21 09:57:07,700 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-21 09:57:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2022-07-21 09:57:07,707 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2022-07-21 09:57:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:07,707 INFO L495 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2022-07-21 09:57:07,707 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-21 09:57:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2022-07-21 09:57:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:57:07,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:07,709 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-21 09:57:07,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 09:57:07,710 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-21 09:57:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:07,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203185462] [2022-07-21 09:57:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:57:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:07,908 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-21 09:57:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203185462] [2022-07-21 09:57:07,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203185462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:07,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:07,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:57:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825005809] [2022-07-21 09:57:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:07,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:57:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:57:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:07,910 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-21 09:57:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:08,965 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2022-07-21 09:57:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:57:08,965 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-21 09:57:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:08,971 INFO L225 Difference]: With dead ends: 3905 [2022-07-21 09:57:08,971 INFO L226 Difference]: Without dead ends: 2681 [2022-07-21 09:57:08,973 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-21 09:57:08,974 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 340 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2530 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-21 09:57:08,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2530 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:57:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-07-21 09:57:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2022-07-21 09:57:09,059 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-21 09:57:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2022-07-21 09:57:09,064 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2022-07-21 09:57:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2022-07-21 09:57:09,065 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-21 09:57:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2022-07-21 09:57:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:57:09,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:09,067 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-21 09:57:09,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:57:09,067 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-21 09:57:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:09,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916270953] [2022-07-21 09:57:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:57:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:09,181 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-21 09:57:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:09,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916270953] [2022-07-21 09:57:09,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916270953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:09,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:09,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:57:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080166592] [2022-07-21 09:57:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:57:09,183 INFO L87 Difference]: Start difference. First operand 2644 states and 3643 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 09:57:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:09,898 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2022-07-21 09:57:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:57:09,899 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-21 09:57:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:09,907 INFO L225 Difference]: With dead ends: 4660 [2022-07-21 09:57:09,908 INFO L226 Difference]: Without dead ends: 3432 [2022-07-21 09:57:09,927 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-21 09:57:09,928 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 426 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2111 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-21 09:57:09,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2111 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:57:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-07-21 09:57:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2022-07-21 09:57:10,160 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-21 09:57:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2022-07-21 09:57:10,166 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2022-07-21 09:57:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:10,166 INFO L495 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2022-07-21 09:57:10,166 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-21 09:57:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2022-07-21 09:57:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:57:10,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:10,169 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-21 09:57:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:57:10,169 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-21 09:57:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794591173] [2022-07-21 09:57:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:57:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:57:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:57:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:57:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 09:57:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:10,268 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-21 09:57:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:10,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794591173] [2022-07-21 09:57:10,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794591173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:10,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:10,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:57:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515200653] [2022-07-21 09:57:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:10,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:10,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:57:10,272 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-21 09:57:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:11,666 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2022-07-21 09:57:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:11,666 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-21 09:57:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:11,673 INFO L225 Difference]: With dead ends: 5424 [2022-07-21 09:57:11,673 INFO L226 Difference]: Without dead ends: 2778 [2022-07-21 09:57:11,678 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-21 09:57:11,679 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-21 09:57:11,679 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-21 09:57:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-07-21 09:57:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2022-07-21 09:57:11,770 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-21 09:57:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2022-07-21 09:57:11,777 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2022-07-21 09:57:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:11,778 INFO L495 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2022-07-21 09:57:11,778 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-21 09:57:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2022-07-21 09:57:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 09:57:11,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:11,780 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-21 09:57:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 09:57:11,780 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-21 09:57:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185617272] [2022-07-21 09:57:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:57:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:11,994 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-21 09:57:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185617272] [2022-07-21 09:57:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185617272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:11,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:11,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:57:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131195831] [2022-07-21 09:57:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:11,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:57:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:57:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:11,996 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-21 09:57:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:13,920 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2022-07-21 09:57:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:57:13,921 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-21 09:57:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:13,932 INFO L225 Difference]: With dead ends: 3982 [2022-07-21 09:57:13,932 INFO L226 Difference]: Without dead ends: 3979 [2022-07-21 09:57:13,934 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-21 09:57:13,935 INFO L413 NwaCegarLoop]: 1003 mSDtfsCounter, 2072 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:13,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 2902 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 09:57:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2022-07-21 09:57:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2022-07-21 09:57:14,235 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-21 09:57:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2022-07-21 09:57:14,259 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2022-07-21 09:57:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:14,260 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2022-07-21 09:57:14,260 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-21 09:57:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2022-07-21 09:57:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:57:14,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:14,263 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-21 09:57:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 09:57:14,263 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-21 09:57:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234961881] [2022-07-21 09:57:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:57:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:57:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,647 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-21 09:57:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234961881] [2022-07-21 09:57:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234961881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484214997] [2022-07-21 09:57:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:14,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:14,664 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-21 09:57:14,692 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-21 09:57:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 09:57:15,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:15,296 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-21 09:57:15,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:15,426 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-21 09:57:15,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484214997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:15,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:15,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-07-21 09:57:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383958733] [2022-07-21 09:57:15,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:15,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 09:57:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 09:57:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:57:15,427 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-21 09:57:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:20,163 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2022-07-21 09:57:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 09:57:20,164 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-21 09:57:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:20,182 INFO L225 Difference]: With dead ends: 11133 [2022-07-21 09:57:20,182 INFO L226 Difference]: Without dead ends: 7266 [2022-07-21 09:57:20,195 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-21 09:57:20,195 INFO L413 NwaCegarLoop]: 931 mSDtfsCounter, 1009 mSDsluCounter, 12665 mSDsCounter, 0 mSdLazyCounter, 7784 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 13596 SdHoareTripleChecker+Invalid, 8354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 7784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 13596 Invalid, 8354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 7784 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-21 09:57:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2022-07-21 09:57:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2022-07-21 09:57:20,453 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-21 09:57:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2022-07-21 09:57:20,462 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2022-07-21 09:57:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:20,463 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2022-07-21 09:57:20,463 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-21 09:57:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2022-07-21 09:57:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-21 09:57:20,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:20,465 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-21 09:57:20,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 09:57:20,689 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-21 09:57:20,689 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2022-07-21 09:57:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:20,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493079882] [2022-07-21 09:57:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:57:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:57:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:57:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,901 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-21 09:57:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:20,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493079882] [2022-07-21 09:57:20,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493079882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:20,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:20,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 09:57:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905845372] [2022-07-21 09:57:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:20,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:57:20,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:20,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:57:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:20,903 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-21 09:57:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:23,416 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2022-07-21 09:57:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:57:23,416 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-21 09:57:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:23,434 INFO L225 Difference]: With dead ends: 10144 [2022-07-21 09:57:23,434 INFO L226 Difference]: Without dead ends: 8384 [2022-07-21 09:57:23,439 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-21 09:57:23,440 INFO L413 NwaCegarLoop]: 907 mSDtfsCounter, 1947 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:23,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 3753 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 09:57:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2022-07-21 09:57:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2022-07-21 09:57:23,828 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-21 09:57:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2022-07-21 09:57:23,853 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2022-07-21 09:57:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:23,854 INFO L495 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2022-07-21 09:57:23,854 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-21 09:57:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2022-07-21 09:57:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 09:57:23,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:23,857 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-21 09:57:23,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 09:57:23,857 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-21 09:57:23,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:23,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131062055] [2022-07-21 09:57:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:23,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:57:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:57:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:57:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,051 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-21 09:57:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131062055] [2022-07-21 09:57:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131062055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:24,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:24,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:57:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684539827] [2022-07-21 09:57:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:24,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:57:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:57:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:57:24,054 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-21 09:57:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:26,474 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2022-07-21 09:57:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:57:26,475 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-21 09:57:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:26,498 INFO L225 Difference]: With dead ends: 17611 [2022-07-21 09:57:26,499 INFO L226 Difference]: Without dead ends: 10847 [2022-07-21 09:57:26,510 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-21 09:57:26,516 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 462 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 6440 SdHoareTripleChecker+Invalid, 3328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:26,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 6440 Invalid, 3328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 09:57:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2022-07-21 09:57:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2022-07-21 09:57:26,878 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-21 09:57:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2022-07-21 09:57:26,899 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2022-07-21 09:57:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:26,900 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2022-07-21 09:57:26,900 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-21 09:57:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2022-07-21 09:57:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 09:57:26,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:26,903 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-21 09:57:26,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 09:57:26,903 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-21 09:57:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:26,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922317573] [2022-07-21 09:57:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:57:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:57:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:57:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:57:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:57:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:57:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:57:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,114 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-21 09:57:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922317573] [2022-07-21 09:57:27,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922317573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065271782] [2022-07-21 09:57:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:27,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:27,116 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-21 09:57:27,117 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-21 09:57:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:27,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:27,556 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-21 09:57:27,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065271782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:27,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-21 09:57:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468239158] [2022-07-21 09:57:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:27,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:27,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:27,558 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-21 09:57:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:27,862 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2022-07-21 09:57:27,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:27,862 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-21 09:57:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:27,881 INFO L225 Difference]: With dead ends: 16288 [2022-07-21 09:57:27,881 INFO L226 Difference]: Without dead ends: 8174 [2022-07-21 09:57:27,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:27,896 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-21 09:57:27,896 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-21 09:57:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2022-07-21 09:57:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2022-07-21 09:57:28,291 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-21 09:57:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2022-07-21 09:57:28,312 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2022-07-21 09:57:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:28,313 INFO L495 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2022-07-21 09:57:28,313 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-21 09:57:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2022-07-21 09:57:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 09:57:28,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:28,315 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-21 09:57:28,338 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-21 09:57:28,538 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-21 09:57:28,538 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2022-07-21 09:57:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:28,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515035257] [2022-07-21 09:57:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:57:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:57:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 09:57:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:57:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:57:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:57:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:57:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,747 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-21 09:57:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515035257] [2022-07-21 09:57:28,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515035257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:28,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:28,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:57:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592845737] [2022-07-21 09:57:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:28,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:57:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:57:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:28,749 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-21 09:57:33,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:35,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:35,642 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2022-07-21 09:57:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:57:35,642 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-21 09:57:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:35,678 INFO L225 Difference]: With dead ends: 18980 [2022-07-21 09:57:35,678 INFO L226 Difference]: Without dead ends: 12202 [2022-07-21 09:57:35,698 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-21 09:57:35,698 INFO L413 NwaCegarLoop]: 792 mSDtfsCounter, 505 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3693 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:35,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 3693 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 09:57:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2022-07-21 09:57:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2022-07-21 09:57:36,209 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-21 09:57:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2022-07-21 09:57:36,230 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2022-07-21 09:57:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:36,230 INFO L495 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2022-07-21 09:57:36,230 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-21 09:57:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2022-07-21 09:57:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 09:57:36,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:36,233 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-21 09:57:36,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 09:57:36,233 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-21 09:57:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:36,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524930476] [2022-07-21 09:57:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:57:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:57:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:57:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:57:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:57:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,502 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-21 09:57:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524930476] [2022-07-21 09:57:36,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524930476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:36,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:36,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 09:57:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230535399] [2022-07-21 09:57:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:36,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 09:57:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:36,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 09:57:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:57:36,508 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-21 09:57:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:39,074 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2022-07-21 09:57:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 09:57:39,075 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-21 09:57:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:39,101 INFO L225 Difference]: With dead ends: 15028 [2022-07-21 09:57:39,102 INFO L226 Difference]: Without dead ends: 10127 [2022-07-21 09:57:39,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-07-21 09:57:39,114 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 559 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 6152 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:39,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 6152 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2941 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 09:57:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2022-07-21 09:57:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2022-07-21 09:57:39,474 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-21 09:57:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2022-07-21 09:57:39,497 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2022-07-21 09:57:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:39,497 INFO L495 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2022-07-21 09:57:39,497 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-21 09:57:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2022-07-21 09:57:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 09:57:39,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:39,500 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-21 09:57:39,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 09:57:39,500 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2022-07-21 09:57:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:39,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578043932] [2022-07-21 09:57:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:57:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:57:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:57:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:57:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:57:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:57:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,657 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-21 09:57:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578043932] [2022-07-21 09:57:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578043932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719321661] [2022-07-21 09:57:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:39,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:39,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:39,665 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-21 09:57:39,755 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-21 09:57:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:40,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:57:40,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:40,262 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-21 09:57:40,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:40,319 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-21 09:57:40,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719321661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:40,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:40,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2022-07-21 09:57:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457858665] [2022-07-21 09:57:40,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:40,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:57:40,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:57:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:40,322 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-21 09:57:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:43,726 INFO L93 Difference]: Finished difference Result 14665 states and 19980 transitions. [2022-07-21 09:57:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:57:43,727 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-21 09:57:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:43,753 INFO L225 Difference]: With dead ends: 14665 [2022-07-21 09:57:43,753 INFO L226 Difference]: Without dead ends: 7538 [2022-07-21 09:57:43,773 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-21 09:57:43,774 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 243 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:43,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3209 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 09:57:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-07-21 09:57:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7268. [2022-07-21 09:57:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 5338 states have (on average 1.252341701011615) internal successors, (6685), 5383 states have internal predecessors, (6685), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1667), 1505 states have call predecessors, (1667), 1484 states have call successors, (1667) [2022-07-21 09:57:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 9842 transitions. [2022-07-21 09:57:44,292 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 9842 transitions. Word has length 111 [2022-07-21 09:57:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:44,293 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 9842 transitions. [2022-07-21 09:57:44,293 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-21 09:57:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 9842 transitions. [2022-07-21 09:57:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 09:57:44,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:44,296 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-21 09:57:44,333 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-21 09:57:44,517 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-21 09:57:44,518 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 800394672, now seen corresponding path program 1 times [2022-07-21 09:57:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450033583] [2022-07-21 09:57:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:57:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:57:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 09:57:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:57:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 09:57:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:57:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,775 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-21 09:57:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:44,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450033583] [2022-07-21 09:57:44,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450033583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:44,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:44,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 09:57:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871752660] [2022-07-21 09:57:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:44,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 09:57:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 09:57:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:57:44,777 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-21 09:57:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:47,407 INFO L93 Difference]: Finished difference Result 13334 states and 18523 transitions. [2022-07-21 09:57:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:57:47,408 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-21 09:57:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:47,433 INFO L225 Difference]: With dead ends: 13334 [2022-07-21 09:57:47,434 INFO L226 Difference]: Without dead ends: 10002 [2022-07-21 09:57:47,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-21 09:57:47,442 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 655 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:47,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 5632 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 09:57:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2022-07-21 09:57:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 7266. [2022-07-21 09:57:47,821 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-21 09:57:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 9824 transitions. [2022-07-21 09:57:47,842 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 9824 transitions. Word has length 121 [2022-07-21 09:57:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:47,842 INFO L495 AbstractCegarLoop]: Abstraction has 7266 states and 9824 transitions. [2022-07-21 09:57:47,842 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-21 09:57:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 9824 transitions. [2022-07-21 09:57:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 09:57:47,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:47,845 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-21 09:57:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 09:57:47,845 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-21 09:57:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059326448] [2022-07-21 09:57:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 09:57:47,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 09:57:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 09:57:48,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 09:57:48,153 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 09:57:48,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:57:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 09:57:48,159 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-21 09:57:48,162 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:57:48,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:57:48 BoogieIcfgContainer [2022-07-21 09:57:48,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:57:48,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:57:48,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:57:48,301 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:57:48,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:47" (3/4) ... [2022-07-21 09:57:48,303 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 09:57:48,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:57:48,304 INFO L158 Benchmark]: Toolchain (without parser) took 64373.91ms. Allocated memory was 58.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 28.8MB in the beginning and 628.5MB in the end (delta: -599.7MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,304 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:57:48,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1406.37ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 28.7MB in the beginning and 47.8MB in the end (delta: -19.1MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.01ms. Allocated memory is still 104.9MB. Free memory was 47.8MB in the beginning and 38.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,305 INFO L158 Benchmark]: Boogie Preprocessor took 130.20ms. Allocated memory is still 104.9MB. Free memory was 38.4MB in the beginning and 53.4MB in the end (delta: -15.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,305 INFO L158 Benchmark]: RCFGBuilder took 2101.27ms. Allocated memory was 104.9MB in the beginning and 195.0MB in the end (delta: 90.2MB). Free memory was 53.4MB in the beginning and 101.9MB in the end (delta: -48.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,307 INFO L158 Benchmark]: TraceAbstraction took 60605.87ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 101.9MB in the beginning and 629.6MB in the end (delta: -527.7MB). Peak memory consumption was 574.4MB. Max. memory is 16.1GB. [2022-07-21 09:57:48,307 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 1.3GB. Free memory was 629.6MB in the beginning and 628.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:57:48,315 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.14ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1406.37ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 28.7MB in the beginning and 47.8MB in the end (delta: -19.1MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.01ms. Allocated memory is still 104.9MB. Free memory was 47.8MB in the beginning and 38.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.20ms. Allocated memory is still 104.9MB. Free memory was 38.4MB in the beginning and 53.4MB in the end (delta: -15.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2101.27ms. Allocated memory was 104.9MB in the beginning and 195.0MB in the end (delta: 90.2MB). Free memory was 53.4MB in the beginning and 101.9MB in the end (delta: -48.5MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 60605.87ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 101.9MB in the beginning and 629.6MB in the end (delta: -527.7MB). Peak memory consumption was 574.4MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 1.3GB. Free memory was 629.6MB in the beginning and 628.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of 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:70}, 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:70}, cf->can_dlc=0, dev={0:-519}, dev={0:-519}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, cf->can_id=18446744073709551628, 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:70}, cf->can_id=18446744073709551628, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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:70}, 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: 60.4s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17411 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16148 mSDsluCounter, 90288 SdHoareTripleChecker+Invalid, 34.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71592 mSDsCounter, 8259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40981 IncrementalHoareTripleChecker+Invalid, 49240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8259 mSolverCounterUnsat, 18696 mSDtfsCounter, 40981 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.3s 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.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 27213 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 4974 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-21 09:57:48,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:57:50,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:57:50,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:57:50,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:57:50,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:57:50,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:57:50,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:57:50,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:57:50,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:57:50,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:57:50,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:57:50,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:57:50,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:57:50,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:57:50,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:57:50,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:57:50,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:57:50,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:57:50,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:57:50,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:57:50,327 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:57:50,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:57:50,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:57:50,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:57:50,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:57:50,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:57:50,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:57:50,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:57:50,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:57:50,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:57:50,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:57:50,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:57:50,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:57:50,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:57:50,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:57:50,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:57:50,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:57:50,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:57:50,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:57:50,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:57:50,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:57:50,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:57:50,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 09:57:50,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:57:50,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:57:50,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:57:50,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:57:50,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:57:50,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:57:50,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:57:50,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:57:50,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:57:50,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:57:50,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:57:50,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:57:50,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:57:50,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:57:50,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:57:50,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:57:50,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:57:50,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:57:50,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:50,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:57:50,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:57:50,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:57:50,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 09:57:50,381 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-21 09:57:50,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:57:50,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:57:50,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:57:50,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:57:50,658 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:57:50,660 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-21 09:57:50,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e45940c/bcaba73553644299a6b1b59809e1617b/FLAGd58afceb3 [2022-07-21 09:57:51,254 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:57:51,255 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-21 09:57:51,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e45940c/bcaba73553644299a6b1b59809e1617b/FLAGd58afceb3 [2022-07-21 09:57:51,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e45940c/bcaba73553644299a6b1b59809e1617b [2022-07-21 09:57:51,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:57:51,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:57:51,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:51,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:57:51,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:57:51,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:51" (1/1) ... [2022-07-21 09:57:51,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392777ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:51, skipping insertion in model container [2022-07-21 09:57:51,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:51" (1/1) ... [2022-07-21 09:57:51,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:57:51,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:57:52,428 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-21 09:57:52,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:52,490 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 09:57:52,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:57:52,717 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-21 09:57:52,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:52,755 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:57:52,980 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-21 09:57:52,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:53,105 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:57:53,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53 WrapperNode [2022-07-21 09:57:53,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:53,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:53,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:57:53,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:57:53,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,225 INFO L137 Inliner]: procedures = 148, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1342 [2022-07-21 09:57:53,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:53,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:57:53,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:57:53,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:57:53,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:57:53,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:57:53,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:57:53,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:57:53,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (1/1) ... [2022-07-21 09:57:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:53,378 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-21 09:57:53,412 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-21 09:57:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-21 09:57:53,434 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-21 09:57:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 09:57:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-21 09:57:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-21 09:57:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 09:57:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 09:57:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-21 09:57:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 09:57:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:57:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:57:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 09:57:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 09:57:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-21 09:57:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-21 09:57:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:57:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:57:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:57:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:57:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-21 09:57:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-21 09:57:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-21 09:57:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-21 09:57:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:57:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:57:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-21 09:57:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-21 09:57:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 09:57:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 09:57:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:57:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:57:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-21 09:57:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-21 09:57:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-21 09:57:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-21 09:57:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 09:57:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 09:57:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 09:57:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 09:57:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-21 09:57:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-21 09:57:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:57:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-21 09:57:53,440 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-21 09:57:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:57:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 09:57:53,440 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 09:57:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:57:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:57:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-21 09:57:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-21 09:57:53,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-21 09:57:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-21 09:57:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-21 09:57:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-21 09:57:53,443 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-21 09:57:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-21 09:57:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-21 09:57:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:57:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-21 09:57:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-21 09:57:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:57:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:57:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-21 09:57:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-21 09:57:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-21 09:57:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 09:57:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:57:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 09:57:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-21 09:57:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-21 09:57:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 09:57:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 09:57:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-21 09:57:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-21 09:57:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 09:57:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 09:57:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-21 09:57:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-21 09:57:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 09:57:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 09:57:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 09:57:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 09:57:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:57:53,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:57:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-21 09:57:53,449 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-21 09:57:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-21 09:57:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-21 09:57:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-21 09:57:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 09:57:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 09:57:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:57:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:57:53,695 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:57:53,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:57:54,648 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:57:56,875 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:58:05,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-21 09:58:05,225 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-21 09:58:05,310 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:58:05,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:58:05,319 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-21 09:58:05,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:58:05 BoogieIcfgContainer [2022-07-21 09:58:05,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:58:05,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:58:05,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:58:05,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:58:05,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:57:51" (1/3) ... [2022-07-21 09:58:05,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d28b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:58:05, skipping insertion in model container [2022-07-21 09:58:05,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:53" (2/3) ... [2022-07-21 09:58:05,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d28b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:58:05, skipping insertion in model container [2022-07-21 09:58:05,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:58:05" (3/3) ... [2022-07-21 09:58:05,327 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-21 09:58:05,337 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:58:05,337 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:58:05,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:58:05,380 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@35d36a40, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32270528 [2022-07-21 09:58:05,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:58:05,385 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-21 09:58:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 09:58:05,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:05,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:58:05,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-21 09:58:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895635472] [2022-07-21 09:58:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:05,447 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-21 09:58:05,453 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-21 09:58:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:05,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:05,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:06,155 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-21 09:58:06,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:06,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895635472] [2022-07-21 09:58:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895635472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:06,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:06,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:58:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244123828] [2022-07-21 09:58:06,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:06,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:06,192 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 09:58:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:06,370 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-21 09:58:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:06,372 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-21 09:58:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:06,393 INFO L225 Difference]: With dead ends: 1253 [2022-07-21 09:58:06,393 INFO L226 Difference]: Without dead ends: 824 [2022-07-21 09:58:06,400 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-21 09:58:06,403 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 539 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:06,405 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.0s Time] [2022-07-21 09:58:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-21 09:58:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-21 09:58:06,486 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-21 09:58:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-21 09:58:06,499 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-21 09:58:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:06,500 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-21 09:58:06,500 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-21 09:58:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-21 09:58:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:58:06,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:06,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:58:06,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 09:58:06,715 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-21 09:58:06,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-21 09:58:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547194720] [2022-07-21 09:58:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:06,745 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-21 09:58:06,746 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-21 09:58:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:07,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:07,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:07,243 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-21 09:58:07,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:07,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:07,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547194720] [2022-07-21 09:58:07,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547194720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:07,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:07,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:58:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606618607] [2022-07-21 09:58:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:07,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:07,245 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-21 09:58:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:07,339 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-21 09:58:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:07,340 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-21 09:58:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:07,346 INFO L225 Difference]: With dead ends: 2433 [2022-07-21 09:58:07,347 INFO L226 Difference]: Without dead ends: 1617 [2022-07-21 09:58:07,349 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-21 09:58:07,350 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-21 09:58:07,350 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-21 09:58:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-21 09:58:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-21 09:58:07,428 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-21 09:58:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-21 09:58:07,435 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-21 09:58:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:07,436 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-21 09:58:07,436 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-21 09:58:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-21 09:58:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 09:58:07,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:07,439 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-21 09:58:07,467 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-21 09:58:07,668 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-21 09:58:07,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-21 09:58:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200426307] [2022-07-21 09:58:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:07,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:07,672 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-21 09:58:07,675 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-21 09:58:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:08,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 09:58:08,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:08,287 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-21 09:58:08,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:08,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:08,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200426307] [2022-07-21 09:58:08,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200426307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:08,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:08,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:58:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558359476] [2022-07-21 09:58:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:08,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:58:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:58:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:58:08,295 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-21 09:58:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:08,394 INFO L93 Difference]: Finished difference Result 3212 states and 4225 transitions. [2022-07-21 09:58:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:08,395 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-21 09:58:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:08,402 INFO L225 Difference]: With dead ends: 3212 [2022-07-21 09:58:08,402 INFO L226 Difference]: Without dead ends: 1610 [2022-07-21 09:58:08,406 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-21 09:58:08,408 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-21 09:58:08,409 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-21 09:58:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-07-21 09:58:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2022-07-21 09:58:08,459 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-21 09:58:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-21 09:58:08,466 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-21 09:58:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:08,466 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-21 09:58:08,466 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-21 09:58:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-21 09:58:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 09:58:08,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:08,472 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-21 09:58:08,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 09:58:08,696 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-21 09:58:08,697 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-21 09:58:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:08,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596153315] [2022-07-21 09:58:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:08,700 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-21 09:58:08,703 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-21 09:58:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:09,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:09,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:09,255 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-21 09:58:09,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:09,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:09,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596153315] [2022-07-21 09:58:09,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596153315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:09,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:09,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:58:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452369673] [2022-07-21 09:58:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:09,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:09,257 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-21 09:58:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:09,361 INFO L93 Difference]: Finished difference Result 3924 states and 5357 transitions. [2022-07-21 09:58:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:09,362 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-21 09:58:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:09,369 INFO L225 Difference]: With dead ends: 3924 [2022-07-21 09:58:09,370 INFO L226 Difference]: Without dead ends: 2325 [2022-07-21 09:58:09,373 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-21 09:58:09,374 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-21 09:58:09,374 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-21 09:58:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-07-21 09:58:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2313. [2022-07-21 09:58:09,420 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-21 09:58:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-21 09:58:09,429 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-21 09:58:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:09,429 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-21 09:58:09,429 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-21 09:58:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-21 09:58:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 09:58:09,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:09,431 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-21 09:58:09,446 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-21 09:58:09,645 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-21 09:58:09,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-21 09:58:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:09,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526962908] [2022-07-21 09:58:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:09,648 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-21 09:58:09,649 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-21 09:58:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:10,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:10,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:10,173 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-21 09:58:10,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:10,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526962908] [2022-07-21 09:58:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526962908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:10,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:10,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:58:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095721897] [2022-07-21 09:58:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:10,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:58:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:58:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:58:10,175 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-21 09:58:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:10,515 INFO L93 Difference]: Finished difference Result 6261 states and 9014 transitions. [2022-07-21 09:58:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:58:10,515 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-21 09:58:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:10,530 INFO L225 Difference]: With dead ends: 6261 [2022-07-21 09:58:10,531 INFO L226 Difference]: Without dead ends: 3960 [2022-07-21 09:58:10,537 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-21 09:58:10,538 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-21 09:58:10,538 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-21 09:58:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2022-07-21 09:58:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2329. [2022-07-21 09:58:10,607 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-21 09:58:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3240 transitions. [2022-07-21 09:58:10,614 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3240 transitions. Word has length 68 [2022-07-21 09:58:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:10,615 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 3240 transitions. [2022-07-21 09:58:10,615 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-21 09:58:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3240 transitions. [2022-07-21 09:58:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:58:10,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:10,617 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-21 09:58:10,634 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-21 09:58:10,832 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-21 09:58:10,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-21 09:58:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759262811] [2022-07-21 09:58:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:10,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:10,835 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-21 09:58:10,836 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-21 09:58:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:11,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:11,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:58:11,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:11,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759262811] [2022-07-21 09:58:11,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759262811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:11,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:11,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:58:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972965138] [2022-07-21 09:58:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:11,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:58:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:58:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:58:11,385 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-21 09:58:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:11,731 INFO L93 Difference]: Finished difference Result 5821 states and 8310 transitions. [2022-07-21 09:58:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:58:11,731 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-21 09:58:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:11,746 INFO L225 Difference]: With dead ends: 5821 [2022-07-21 09:58:11,746 INFO L226 Difference]: Without dead ends: 3504 [2022-07-21 09:58:11,753 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-21 09:58:11,753 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-21 09:58:11,754 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-21 09:58:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2022-07-21 09:58:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2345. [2022-07-21 09:58:11,831 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-21 09:58:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3256 transitions. [2022-07-21 09:58:11,838 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3256 transitions. Word has length 69 [2022-07-21 09:58:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:11,839 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3256 transitions. [2022-07-21 09:58:11,839 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-21 09:58:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3256 transitions. [2022-07-21 09:58:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:58:11,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:11,841 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-21 09:58:11,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 09:58:12,055 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-21 09:58:12,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-21 09:58:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:12,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335893601] [2022-07-21 09:58:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:12,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:12,058 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-21 09:58:12,060 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-21 09:58:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:12,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:58:12,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:13,054 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-21 09:58:13,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:13,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:13,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335893601] [2022-07-21 09:58:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335893601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:13,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:13,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:58:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455668153] [2022-07-21 09:58:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:13,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:58:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:58:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:58:13,056 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-21 09:58:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:13,258 INFO L93 Difference]: Finished difference Result 3553 states and 4967 transitions. [2022-07-21 09:58:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:58:13,259 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-21 09:58:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:13,268 INFO L225 Difference]: With dead ends: 3553 [2022-07-21 09:58:13,268 INFO L226 Difference]: Without dead ends: 2377 [2022-07-21 09:58:13,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:58:13,273 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-21 09:58:13,273 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-21 09:58:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-21 09:58:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2022-07-21 09:58:13,336 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-21 09:58:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-21 09:58:13,342 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-21 09:58:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:13,343 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-21 09:58:13,343 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-21 09:58:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-21 09:58:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 09:58:13,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:13,345 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-21 09:58:13,378 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-21 09:58:13,580 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-21 09:58:13,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-21 09:58:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:13,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996601048] [2022-07-21 09:58:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:13,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:13,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:13,583 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-21 09:58:13,585 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-21 09:58:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:14,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 09:58:14,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:14,562 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-21 09:58:14,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:14,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:14,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996601048] [2022-07-21 09:58:14,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996601048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:58:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130069602] [2022-07-21 09:58:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:14,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:58:14,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:58:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:58:14,563 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-21 09:58:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:15,816 INFO L93 Difference]: Finished difference Result 5537 states and 7892 transitions. [2022-07-21 09:58:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:58:15,817 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-21 09:58:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:15,835 INFO L225 Difference]: With dead ends: 5537 [2022-07-21 09:58:15,836 INFO L226 Difference]: Without dead ends: 3172 [2022-07-21 09:58:15,842 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-21 09:58:15,843 INFO L413 NwaCegarLoop]: 913 mSDtfsCounter, 217 mSDsluCounter, 6908 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 7821 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:15,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 7821 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 09:58:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-07-21 09:58:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2381. [2022-07-21 09:58:15,914 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-21 09:58:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-21 09:58:15,920 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-21 09:58:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:15,920 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-21 09:58:15,921 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-21 09:58:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-21 09:58:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:58:15,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:15,924 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-21 09:58:15,940 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-21 09:58:16,140 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-21 09:58:16,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1804654053, now seen corresponding path program 1 times [2022-07-21 09:58:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271080594] [2022-07-21 09:58:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:16,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:16,143 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-21 09:58:16,144 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-21 09:58:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:16,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:58:16,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:16,851 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-21 09:58:16,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:16,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:16,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271080594] [2022-07-21 09:58:16,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271080594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:16,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:16,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:58:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623112692] [2022-07-21 09:58:16,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:16,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:58:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:58:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:58:16,852 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-21 09:58:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:17,200 INFO L93 Difference]: Finished difference Result 5691 states and 8110 transitions. [2022-07-21 09:58:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:17,201 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-21 09:58:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:17,215 INFO L225 Difference]: With dead ends: 5691 [2022-07-21 09:58:17,215 INFO L226 Difference]: Without dead ends: 3322 [2022-07-21 09:58:17,221 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-21 09:58:17,223 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 168 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 3047 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:17,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 3047 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:58:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-07-21 09:58:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2171. [2022-07-21 09:58:17,310 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-21 09:58:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2982 transitions. [2022-07-21 09:58:17,316 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2982 transitions. Word has length 75 [2022-07-21 09:58:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:17,317 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 2982 transitions. [2022-07-21 09:58:17,317 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-21 09:58:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2982 transitions. [2022-07-21 09:58:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 09:58:17,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:17,320 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-21 09:58:17,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-21 09:58:17,536 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-21 09:58:17,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-21 09:58:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:17,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260349534] [2022-07-21 09:58:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:17,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:17,548 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-21 09:58:17,567 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-21 09:58:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:18,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:58:18,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:18,914 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-21 09:58:18,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:18,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260349534] [2022-07-21 09:58:18,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260349534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:18,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:18,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:58:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104399898] [2022-07-21 09:58:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:18,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:58:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:58:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:58:18,915 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-21 09:58:21,358 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-21 09:58:23,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:58:26,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:58:30,738 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-21 09:58:32,750 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-21 09:58:35,134 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-21 09:58:37,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:58:42,111 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-21 09:58:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:46,835 INFO L93 Difference]: Finished difference Result 5559 states and 7703 transitions. [2022-07-21 09:58:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:58:46,836 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-21 09:58:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:46,862 INFO L225 Difference]: With dead ends: 5559 [2022-07-21 09:58:46,863 INFO L226 Difference]: Without dead ends: 4349 [2022-07-21 09:58:46,866 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-21 09:58:46,866 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 1146 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 315 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:46,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2484 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1823 Invalid, 7 Unknown, 0 Unchecked, 27.5s Time] [2022-07-21 09:58:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2022-07-21 09:58:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 3357. [2022-07-21 09:58:46,975 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-21 09:58:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4649 transitions. [2022-07-21 09:58:46,982 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4649 transitions. Word has length 75 [2022-07-21 09:58:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:46,983 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4649 transitions. [2022-07-21 09:58:46,983 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-21 09:58:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4649 transitions. [2022-07-21 09:58:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:58:46,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:46,985 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-21 09:58:47,000 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-21 09:58:47,200 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-21 09:58:47,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash -418091033, now seen corresponding path program 1 times [2022-07-21 09:58:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:47,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976357137] [2022-07-21 09:58:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:47,203 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-21 09:58:47,205 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-21 09:58:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:47,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:47,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:47,794 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-21 09:58:47,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:47,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976357137] [2022-07-21 09:58:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976357137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:47,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:47,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:58:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355100170] [2022-07-21 09:58:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:47,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:47,795 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-21 09:58:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:47,933 INFO L93 Difference]: Finished difference Result 6708 states and 9388 transitions. [2022-07-21 09:58:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:47,934 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-21 09:58:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:47,945 INFO L225 Difference]: With dead ends: 6708 [2022-07-21 09:58:47,945 INFO L226 Difference]: Without dead ends: 3363 [2022-07-21 09:58:47,953 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-21 09:58:47,954 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-21 09:58:47,954 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-21 09:58:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-07-21 09:58:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3363. [2022-07-21 09:58:48,078 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-21 09:58:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4655 transitions. [2022-07-21 09:58:48,086 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4655 transitions. Word has length 94 [2022-07-21 09:58:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:48,087 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4655 transitions. [2022-07-21 09:58:48,087 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-21 09:58:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4655 transitions. [2022-07-21 09:58:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 09:58:48,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:48,089 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-21 09:58:48,127 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-21 09:58:48,303 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-21 09:58:48,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1449980852, now seen corresponding path program 1 times [2022-07-21 09:58:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:48,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793723441] [2022-07-21 09:58:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:48,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:48,307 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-21 09:58:48,308 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-21 09:58:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:48,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 09:58:48,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:48,990 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-21 09:58:48,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:58:49,268 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-21 09:58:49,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:49,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793723441] [2022-07-21 09:58:49,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793723441] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:58:49,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:58:49,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 09:58:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126767657] [2022-07-21 09:58:49,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:58:49,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:58:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:58:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:58:49,270 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-21 09:58:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:49,560 INFO L93 Difference]: Finished difference Result 6732 states and 9424 transitions. [2022-07-21 09:58:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:58:49,561 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-21 09:58:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:49,570 INFO L225 Difference]: With dead ends: 6732 [2022-07-21 09:58:49,570 INFO L226 Difference]: Without dead ends: 3381 [2022-07-21 09:58:49,596 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-21 09:58:49,596 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-21 09:58:49,597 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-21 09:58:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-21 09:58:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3381. [2022-07-21 09:58:49,692 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-21 09:58:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4673 transitions. [2022-07-21 09:58:49,700 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4673 transitions. Word has length 95 [2022-07-21 09:58:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:49,701 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4673 transitions. [2022-07-21 09:58:49,701 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-21 09:58:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4673 transitions. [2022-07-21 09:58:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 09:58:49,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:49,703 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-21 09:58:49,720 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-21 09:58:49,920 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-21 09:58:49,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 989690663, now seen corresponding path program 2 times [2022-07-21 09:58:49,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:49,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909574845] [2022-07-21 09:58:49,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:58:49,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:49,922 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-21 09:58:49,923 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-21 09:58:50,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 09:58:50,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:58:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:58:50,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:50,716 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-21 09:58:50,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:50,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909574845] [2022-07-21 09:58:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909574845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:50,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:58:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018335287] [2022-07-21 09:58:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:58:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:58:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:58:50,719 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-21 09:58:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:51,001 INFO L93 Difference]: Finished difference Result 6768 states and 9395 transitions. [2022-07-21 09:58:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:58:51,002 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-21 09:58:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:51,009 INFO L225 Difference]: With dead ends: 6768 [2022-07-21 09:58:51,009 INFO L226 Difference]: Without dead ends: 3399 [2022-07-21 09:58:51,016 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-21 09:58:51,017 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:51,017 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.2s Time] [2022-07-21 09:58:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-07-21 09:58:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3387. [2022-07-21 09:58:51,155 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-21 09:58:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4679 transitions. [2022-07-21 09:58:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4679 transitions. Word has length 98 [2022-07-21 09:58:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:51,162 INFO L495 AbstractCegarLoop]: Abstraction has 3387 states and 4679 transitions. [2022-07-21 09:58:51,162 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-21 09:58:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4679 transitions. [2022-07-21 09:58:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 09:58:51,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:51,164 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-21 09:58:51,182 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-21 09:58:51,382 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-21 09:58:51,382 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1398514888, now seen corresponding path program 1 times [2022-07-21 09:58:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:51,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059234463] [2022-07-21 09:58:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:51,385 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-21 09:58:51,386 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-21 09:58:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:51,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:58:51,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:52,197 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-21 09:58:52,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:52,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059234463] [2022-07-21 09:58:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059234463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:52,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:52,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:58:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539396540] [2022-07-21 09:58:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:52,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:58:52,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:58:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:58:52,199 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-21 09:58:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:53,348 INFO L93 Difference]: Finished difference Result 8281 states and 11717 transitions. [2022-07-21 09:58:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:53,349 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-21 09:58:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:53,361 INFO L225 Difference]: With dead ends: 8281 [2022-07-21 09:58:53,361 INFO L226 Difference]: Without dead ends: 4906 [2022-07-21 09:58:53,367 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-21 09:58:53,368 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 173 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2842 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:53,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2842 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:58:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2022-07-21 09:58:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3275. [2022-07-21 09:58:53,484 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-21 09:58:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4510 transitions. [2022-07-21 09:58:53,492 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4510 transitions. Word has length 98 [2022-07-21 09:58:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:53,493 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4510 transitions. [2022-07-21 09:58:53,493 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-21 09:58:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4510 transitions. [2022-07-21 09:58:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:58:53,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:53,495 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-21 09:58:53,512 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-21 09:58:53,712 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-21 09:58:53,712 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-21 09:58:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:53,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991814636] [2022-07-21 09:58:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:53,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:53,714 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-21 09:58:53,716 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-21 09:58:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:54,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:58:54,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:54,566 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-21 09:58:54,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:54,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:54,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991814636] [2022-07-21 09:58:54,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991814636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:54,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:54,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:58:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876084872] [2022-07-21 09:58:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:58:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:58:54,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:58:54,568 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-21 09:58:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:54,908 INFO L93 Difference]: Finished difference Result 8021 states and 11370 transitions. [2022-07-21 09:58:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:54,909 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-21 09:58:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:54,921 INFO L225 Difference]: With dead ends: 8021 [2022-07-21 09:58:54,921 INFO L226 Difference]: Without dead ends: 4758 [2022-07-21 09:58:54,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:58:54,930 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:54,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 3060 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:58:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2022-07-21 09:58:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3091. [2022-07-21 09:58:55,047 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-21 09:58:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 4228 transitions. [2022-07-21 09:58:55,054 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 4228 transitions. Word has length 87 [2022-07-21 09:58:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:55,054 INFO L495 AbstractCegarLoop]: Abstraction has 3091 states and 4228 transitions. [2022-07-21 09:58:55,055 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-21 09:58:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 4228 transitions. [2022-07-21 09:58:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:58:55,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:55,057 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-21 09:58:55,086 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-21 09:58:55,281 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-21 09:58:55,282 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-21 09:58:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:55,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895758276] [2022-07-21 09:58:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:55,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:55,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:55,284 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-21 09:58:55,285 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-21 09:58:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:55,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:58:55,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:56,398 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-21 09:58:56,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:56,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895758276] [2022-07-21 09:58:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895758276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:56,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:56,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:58:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280124187] [2022-07-21 09:58:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:56,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:58:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:58:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:58:56,399 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-21 09:58:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:56,637 INFO L93 Difference]: Finished difference Result 4754 states and 6531 transitions. [2022-07-21 09:58:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:58:56,638 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-21 09:58:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:56,661 INFO L225 Difference]: With dead ends: 4754 [2022-07-21 09:58:56,675 INFO L226 Difference]: Without dead ends: 3091 [2022-07-21 09:58:56,679 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-21 09:58:56,680 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-21 09:58:56,680 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-21 09:58:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2022-07-21 09:58:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 3091. [2022-07-21 09:58:56,804 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-21 09:58:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 4224 transitions. [2022-07-21 09:58:56,811 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 4224 transitions. Word has length 87 [2022-07-21 09:58:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:56,811 INFO L495 AbstractCegarLoop]: Abstraction has 3091 states and 4224 transitions. [2022-07-21 09:58:56,811 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-21 09:58:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 4224 transitions. [2022-07-21 09:58:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:58:56,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:56,813 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-21 09:58:56,832 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-21 09:58:57,028 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-21 09:58:57,028 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-21 09:58:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:57,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116028531] [2022-07-21 09:58:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:57,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:57,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:57,031 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-21 09:58:57,033 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-21 09:58:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:57,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:57,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:57,668 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-21 09:58:57,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:57,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116028531] [2022-07-21 09:58:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116028531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:57,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:58:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389138191] [2022-07-21 09:58:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:57,670 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-21 09:58:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:58,003 INFO L93 Difference]: Finished difference Result 5753 states and 8082 transitions. [2022-07-21 09:58:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:58,004 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-21 09:58:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:58,014 INFO L225 Difference]: With dead ends: 5753 [2022-07-21 09:58:58,014 INFO L226 Difference]: Without dead ends: 4090 [2022-07-21 09:58:58,018 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-21 09:58:58,018 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-21 09:58:58,019 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-21 09:58:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-07-21 09:58:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3099. [2022-07-21 09:58:58,166 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-21 09:58:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4232 transitions. [2022-07-21 09:58:58,173 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4232 transitions. Word has length 87 [2022-07-21 09:58:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:58,173 INFO L495 AbstractCegarLoop]: Abstraction has 3099 states and 4232 transitions. [2022-07-21 09:58:58,173 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-21 09:58:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4232 transitions. [2022-07-21 09:58:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:58:58,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:58,175 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-21 09:58:58,194 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-21 09:58:58,392 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-21 09:58:58,392 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-21 09:58:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:58,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658319528] [2022-07-21 09:58:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:58,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:58,395 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-21 09:58:58,396 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-21 09:58:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:58,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:58,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:59,023 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-21 09:58:59,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:59,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658319528] [2022-07-21 09:58:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658319528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:59,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:59,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:58:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67963539] [2022-07-21 09:58:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:58:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:58:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:58:59,025 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-21 09:58:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:59,319 INFO L93 Difference]: Finished difference Result 6248 states and 8519 transitions. [2022-07-21 09:58:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:59,319 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-21 09:58:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:59,328 INFO L225 Difference]: With dead ends: 6248 [2022-07-21 09:58:59,328 INFO L226 Difference]: Without dead ends: 3155 [2022-07-21 09:58:59,332 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-21 09:58:59,332 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-21 09:58:59,333 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-21 09:58:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2022-07-21 09:58:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3117. [2022-07-21 09:58:59,468 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-21 09:58:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4249 transitions. [2022-07-21 09:58:59,476 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4249 transitions. Word has length 94 [2022-07-21 09:58:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:59,476 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4249 transitions. [2022-07-21 09:58:59,476 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-21 09:58:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4249 transitions. [2022-07-21 09:58:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-21 09:58:59,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:59,478 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-21 09:58:59,500 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-21 09:58:59,700 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-21 09:58:59,701 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -153386871, now seen corresponding path program 1 times [2022-07-21 09:58:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:59,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379315412] [2022-07-21 09:58:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:59,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:59,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:59,704 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-21 09:58:59,707 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-21 09:59:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:00,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 09:59:00,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:00,921 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-21 09:59:00,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:00,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379315412] [2022-07-21 09:59:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379315412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:59:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093743529] [2022-07-21 09:59:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:00,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:59:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:59:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:59:00,923 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-21 09:59:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:02,674 INFO L93 Difference]: Finished difference Result 8108 states and 11409 transitions. [2022-07-21 09:59:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:59:02,675 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-21 09:59:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:02,688 INFO L225 Difference]: With dead ends: 8108 [2022-07-21 09:59:02,689 INFO L226 Difference]: Without dead ends: 5003 [2022-07-21 09:59:02,694 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-21 09:59:02,695 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 228 mSDsluCounter, 6195 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 7011 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:02,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 7011 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 09:59:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-07-21 09:59:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3117. [2022-07-21 09:59:02,876 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-21 09:59:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4241 transitions. [2022-07-21 09:59:02,885 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4241 transitions. Word has length 96 [2022-07-21 09:59:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:02,885 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4241 transitions. [2022-07-21 09:59:02,885 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-21 09:59:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4241 transitions. [2022-07-21 09:59:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 09:59:02,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:02,887 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-21 09:59:02,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 09:59:03,107 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-21 09:59:03,107 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-21 09:59:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:03,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670734288] [2022-07-21 09:59:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:03,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:03,110 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-21 09:59:03,151 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-21 09:59:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:03,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:59:03,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:04,778 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-21 09:59:04,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:05,807 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-21 09:59:05,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:05,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670734288] [2022-07-21 09:59:05,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670734288] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:59:05,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:59:05,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-21 09:59:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336575616] [2022-07-21 09:59:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:59:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:59:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:59:05,809 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-21 09:59:08,058 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-21 09:59:10,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:11,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:14,706 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-21 09:59:18,620 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-21 09:59:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:21,532 INFO L93 Difference]: Finished difference Result 6321 states and 8621 transitions. [2022-07-21 09:59:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:59:21,533 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-21 09:59:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:21,547 INFO L225 Difference]: With dead ends: 6321 [2022-07-21 09:59:21,547 INFO L226 Difference]: Without dead ends: 6318 [2022-07-21 09:59:21,548 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-21 09:59:21,549 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 1818 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 551 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:21,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1497 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 871 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2022-07-21 09:59:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6318 states. [2022-07-21 09:59:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6318 to 6209. [2022-07-21 09:59:21,848 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-21 09:59:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 8507 transitions. [2022-07-21 09:59:21,862 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 8507 transitions. Word has length 89 [2022-07-21 09:59:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:21,863 INFO L495 AbstractCegarLoop]: Abstraction has 6209 states and 8507 transitions. [2022-07-21 09:59:21,863 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-21 09:59:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 8507 transitions. [2022-07-21 09:59:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:59:21,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:21,865 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-21 09:59:21,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-21 09:59:22,081 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-21 09:59:22,082 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-21 09:59:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010111219] [2022-07-21 09:59:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:22,085 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-21 09:59:22,087 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-21 09:59:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:59:22,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:23,578 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-21 09:59:23,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:24,665 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-21 09:59:24,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010111219] [2022-07-21 09:59:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010111219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:59:24,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:59:24,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-21 09:59:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221625315] [2022-07-21 09:59:24,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:59:24,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:59:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:59:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:59:24,667 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-21 09:59:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:27,241 INFO L93 Difference]: Finished difference Result 15718 states and 22299 transitions. [2022-07-21 09:59:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:59:27,242 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-21 09:59:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:27,268 INFO L225 Difference]: With dead ends: 15718 [2022-07-21 09:59:27,268 INFO L226 Difference]: Without dead ends: 9521 [2022-07-21 09:59:27,283 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-21 09:59:27,284 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 221 mSDsluCounter, 7811 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 8634 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:27,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 8634 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 09:59:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2022-07-21 09:59:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 6211. [2022-07-21 09:59:27,723 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-21 09:59:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8515 transitions. [2022-07-21 09:59:27,739 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8515 transitions. Word has length 94 [2022-07-21 09:59:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 8515 transitions. [2022-07-21 09:59:27,739 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-21 09:59:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8515 transitions. [2022-07-21 09:59:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 09:59:27,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:27,741 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-21 09:59:27,760 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-21 09:59:27,958 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-21 09:59:27,958 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-21 09:59:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:27,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969767157] [2022-07-21 09:59:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:27,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:27,984 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-21 09:59:27,985 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-21 09:59:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:28,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 09:59:28,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:29,202 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-21 09:59:29,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:29,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:29,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969767157] [2022-07-21 09:59:29,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969767157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:29,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:29,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:59:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330364719] [2022-07-21 09:59:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:29,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:59:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:29,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:59:29,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:59:29,204 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-21 09:59:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:30,696 INFO L93 Difference]: Finished difference Result 13458 states and 19018 transitions. [2022-07-21 09:59:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:59:30,697 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-21 09:59:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:30,715 INFO L225 Difference]: With dead ends: 13458 [2022-07-21 09:59:30,716 INFO L226 Difference]: Without dead ends: 8677 [2022-07-21 09:59:30,724 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-21 09:59:30,724 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 213 mSDsluCounter, 6341 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:30,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 7176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:59:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2022-07-21 09:59:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6211. [2022-07-21 09:59:31,096 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-21 09:59:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8507 transitions. [2022-07-21 09:59:31,110 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8507 transitions. Word has length 97 [2022-07-21 09:59:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:31,111 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 8507 transitions. [2022-07-21 09:59:31,111 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-21 09:59:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8507 transitions. [2022-07-21 09:59:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 09:59:31,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:31,113 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-21 09:59:31,145 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-21 09:59:31,329 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-21 09:59:31,330 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-21 09:59:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:31,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395570714] [2022-07-21 09:59:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:31,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:31,332 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-21 09:59:31,335 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-21 09:59:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:31,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:59:31,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:32,302 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-21 09:59:32,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:32,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395570714] [2022-07-21 09:59:32,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395570714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:32,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:32,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:59:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755448581] [2022-07-21 09:59:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:32,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:59:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:59:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:59:32,304 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-21 09:59:34,490 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-21 09:59:36,801 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-21 09:59:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:36,916 INFO L93 Difference]: Finished difference Result 12479 states and 17093 transitions. [2022-07-21 09:59:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:59:36,917 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-21 09:59:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:36,947 INFO L225 Difference]: With dead ends: 12479 [2022-07-21 09:59:36,947 INFO L226 Difference]: Without dead ends: 6277 [2022-07-21 09:59:36,971 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-21 09:59:36,971 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-21 09:59:36,972 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-21 09:59:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2022-07-21 09:59:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 6220. [2022-07-21 09:59:37,323 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-21 09:59:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 8515 transitions. [2022-07-21 09:59:37,340 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 8515 transitions. Word has length 108 [2022-07-21 09:59:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:37,340 INFO L495 AbstractCegarLoop]: Abstraction has 6220 states and 8515 transitions. [2022-07-21 09:59:37,340 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-21 09:59:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 8515 transitions. [2022-07-21 09:59:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 09:59:37,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:37,342 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-21 09:59:37,364 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-21 09:59:37,562 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-21 09:59:37,562 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1967666458, now seen corresponding path program 1 times [2022-07-21 09:59:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:37,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777210607] [2022-07-21 09:59:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:37,580 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-21 09:59:37,581 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-21 09:59:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:38,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:59:38,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:38,337 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-21 09:59:38,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:38,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:38,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777210607] [2022-07-21 09:59:38,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777210607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:38,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:38,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:59:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006802093] [2022-07-21 09:59:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:38,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:59:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:38,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:59:38,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:59:38,339 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-21 09:59:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:38,704 INFO L93 Difference]: Finished difference Result 12464 states and 17066 transitions. [2022-07-21 09:59:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:59:38,705 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-21 09:59:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:38,718 INFO L225 Difference]: With dead ends: 12464 [2022-07-21 09:59:38,718 INFO L226 Difference]: Without dead ends: 6256 [2022-07-21 09:59:38,727 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-21 09:59:38,734 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-21 09:59:38,735 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-21 09:59:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2022-07-21 09:59:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6244. [2022-07-21 09:59:39,096 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-21 09:59:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6244 states to 6244 states and 8539 transitions. [2022-07-21 09:59:39,114 INFO L78 Accepts]: Start accepts. Automaton has 6244 states and 8539 transitions. Word has length 108 [2022-07-21 09:59:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:39,114 INFO L495 AbstractCegarLoop]: Abstraction has 6244 states and 8539 transitions. [2022-07-21 09:59:39,114 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-21 09:59:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6244 states and 8539 transitions. [2022-07-21 09:59:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 09:59:39,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:39,116 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-21 09:59:39,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-21 09:59:39,331 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-21 09:59:39,331 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-21 09:59:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716213543] [2022-07-21 09:59:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:39,334 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-21 09:59:39,335 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-21 09:59:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:40,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:59:40,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:41,035 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-21 09:59:41,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:41,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:41,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716213543] [2022-07-21 09:59:41,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716213543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:41,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:41,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 09:59:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981844924] [2022-07-21 09:59:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:41,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:59:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:59:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:59:41,036 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-21 09:59:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:42,981 INFO L93 Difference]: Finished difference Result 13485 states and 19006 transitions. [2022-07-21 09:59:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:59:42,982 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-21 09:59:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:43,003 INFO L225 Difference]: With dead ends: 13485 [2022-07-21 09:59:43,004 INFO L226 Difference]: Without dead ends: 8677 [2022-07-21 09:59:43,014 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-21 09:59:43,014 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 209 mSDsluCounter, 7908 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 8734 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:43,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 8734 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 09:59:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2022-07-21 09:59:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6188. [2022-07-21 09:59:43,418 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-21 09:59:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8441 transitions. [2022-07-21 09:59:43,432 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8441 transitions. Word has length 104 [2022-07-21 09:59:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:43,432 INFO L495 AbstractCegarLoop]: Abstraction has 6188 states and 8441 transitions. [2022-07-21 09:59:43,433 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-21 09:59:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8441 transitions. [2022-07-21 09:59:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 09:59:43,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:43,435 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-21 09:59:43,452 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-21 09:59:43,647 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-21 09:59:43,647 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1396982830, now seen corresponding path program 1 times [2022-07-21 09:59:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:43,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229868915] [2022-07-21 09:59:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:43,650 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-21 09:59:43,651 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-21 09:59:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:44,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:59:44,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:44,426 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-21 09:59:44,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:44,609 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-21 09:59:44,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229868915] [2022-07-21 09:59:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229868915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:59:44,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:59:44,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 09:59:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263017133] [2022-07-21 09:59:44,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:59:44,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:59:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:44,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:59:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:59:44,611 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-21 09:59:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:45,251 INFO L93 Difference]: Finished difference Result 12472 states and 17014 transitions. [2022-07-21 09:59:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:59:45,252 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-21 09:59:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:45,264 INFO L225 Difference]: With dead ends: 12472 [2022-07-21 09:59:45,265 INFO L226 Difference]: Without dead ends: 6296 [2022-07-21 09:59:45,274 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-21 09:59:45,276 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-21 09:59:45,276 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-21 09:59:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2022-07-21 09:59:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 6296. [2022-07-21 09:59:45,624 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-21 09:59:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6296 states to 6296 states and 8549 transitions. [2022-07-21 09:59:45,639 INFO L78 Accepts]: Start accepts. Automaton has 6296 states and 8549 transitions. Word has length 111 [2022-07-21 09:59:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:45,639 INFO L495 AbstractCegarLoop]: Abstraction has 6296 states and 8549 transitions. [2022-07-21 09:59:45,640 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-21 09:59:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6296 states and 8549 transitions. [2022-07-21 09:59:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-21 09:59:45,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:45,642 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-21 09:59:45,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 09:59:45,855 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-21 09:59:45,855 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -645931029, now seen corresponding path program 1 times [2022-07-21 09:59:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:45,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975455211] [2022-07-21 09:59:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:45,858 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-21 09:59:45,859 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-21 09:59:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:46,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:59:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:46,912 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-21 09:59:46,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:46,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975455211] [2022-07-21 09:59:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975455211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:46,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:59:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909189768] [2022-07-21 09:59:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:46,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:59:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:59:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:59:46,914 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-21 09:59:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:48,481 INFO L93 Difference]: Finished difference Result 15428 states and 21432 transitions. [2022-07-21 09:59:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:59:48,483 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-21 09:59:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:48,505 INFO L225 Difference]: With dead ends: 15428 [2022-07-21 09:59:48,505 INFO L226 Difference]: Without dead ends: 9144 [2022-07-21 09:59:48,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:59:48,518 INFO L413 NwaCegarLoop]: 750 mSDtfsCounter, 177 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:48,518 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.0s Time] [2022-07-21 09:59:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9144 states. [2022-07-21 09:59:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9144 to 6115. [2022-07-21 09:59:48,902 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-21 09:59:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 8280 transitions. [2022-07-21 09:59:48,917 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 8280 transitions. Word has length 124 [2022-07-21 09:59:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:48,918 INFO L495 AbstractCegarLoop]: Abstraction has 6115 states and 8280 transitions. [2022-07-21 09:59:48,918 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-21 09:59:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 8280 transitions. [2022-07-21 09:59:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 09:59:48,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:48,920 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-21 09:59:48,945 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-21 09:59:49,145 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-21 09:59:49,145 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -61836419, now seen corresponding path program 1 times [2022-07-21 09:59:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:49,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418851595] [2022-07-21 09:59:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:49,147 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-21 09:59:49,149 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-21 09:59:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:49,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:59:49,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:50,887 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-21 09:59:50,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:52,110 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-21 09:59:52,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418851595] [2022-07-21 09:59:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418851595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:59:52,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:59:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-21 09:59:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345313581] [2022-07-21 09:59:52,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:59:52,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:59:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:59:52,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:59:52,113 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-21 09:59:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:55,818 INFO L93 Difference]: Finished difference Result 15747 states and 21947 transitions. [2022-07-21 09:59:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:59:55,819 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-21 09:59:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:55,846 INFO L225 Difference]: With dead ends: 15747 [2022-07-21 09:59:55,846 INFO L226 Difference]: Without dead ends: 9644 [2022-07-21 09:59:55,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:59:55,862 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 232 mSDsluCounter, 8249 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 9032 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.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:55,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 9032 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 09:59:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2022-07-21 09:59:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 6103. [2022-07-21 09:59:56,333 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-21 09:59:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 8244 transitions. [2022-07-21 09:59:56,347 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 8244 transitions. Word has length 122 [2022-07-21 09:59:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:56,348 INFO L495 AbstractCegarLoop]: Abstraction has 6103 states and 8244 transitions. [2022-07-21 09:59:56,348 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-21 09:59:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 8244 transitions. [2022-07-21 09:59:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 09:59:56,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:56,350 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-21 09:59:56,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-21 09:59:56,554 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-21 09:59:56,554 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-21 09:59:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:56,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022603560] [2022-07-21 09:59:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:56,557 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-21 09:59:56,558 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-21 10:00:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 10:00:04,122 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 10:00:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 10:00:10,950 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-21 10:00:10,951 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 10:00:10,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 10:00:10,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-21 10:00:11,171 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-21 10:00:11,174 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-21 10:00:11,176 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 10:00:11,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:00:11 BoogieIcfgContainer [2022-07-21 10:00:11,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 10:00:11,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 10:00:11,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 10:00:11,320 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 10:00:11,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:58:05" (3/4) ... [2022-07-21 10:00:11,323 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 10:00:11,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 10:00:11,324 INFO L158 Benchmark]: Toolchain (without parser) took 139807.04ms. Allocated memory was 56.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 33.3MB in the beginning and 791.7MB in the end (delta: -758.4MB). Peak memory consumption was 341.8MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,324 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 46.1MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 10:00:11,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1585.96ms. Allocated memory was 56.6MB in the beginning and 142.6MB in the end (delta: 86.0MB). Free memory was 33.1MB in the beginning and 81.1MB in the end (delta: -48.0MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.86ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 71.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,329 INFO L158 Benchmark]: Boogie Preprocessor took 127.47ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 61.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,330 INFO L158 Benchmark]: RCFGBuilder took 11966.70ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 61.2MB in the beginning and 74.9MB in the end (delta: -13.7MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,333 INFO L158 Benchmark]: TraceAbstraction took 125995.99ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 971.0MB). Free memory was 74.9MB in the beginning and 791.7MB in the end (delta: -716.7MB). Peak memory consumption was 254.2MB. Max. memory is 16.1GB. [2022-07-21 10:00:11,333 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 1.2GB. Free memory is still 791.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 10:00:11,335 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 46.1MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1585.96ms. Allocated memory was 56.6MB in the beginning and 142.6MB in the end (delta: 86.0MB). Free memory was 33.1MB in the beginning and 81.1MB in the end (delta: -48.0MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.86ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 71.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.47ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 61.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 11966.70ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 61.2MB in the beginning and 74.9MB in the end (delta: -13.7MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * TraceAbstraction took 125995.99ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 971.0MB). Free memory was 74.9MB in the beginning and 791.7MB in the end (delta: -716.7MB). Peak memory consumption was 254.2MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 1.2GB. Free memory is still 791.7MB. 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:2199023257600}, ems_usb_bittiming_const={40: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:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, ems_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:2199023257600}, 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:2199023257600}, ems_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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, dev={0:2199023257600}, 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:2199023257600}, 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: 125.8s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 69.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 8266 SdHoareTripleChecker+Valid, 60.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7269 mSDsluCounter, 96101 SdHoareTripleChecker+Invalid, 57.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76000 mSDsCounter, 1157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4277 IncrementalHoareTripleChecker+Invalid, 5446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1157 mSolverCounterUnsat, 20101 mSDtfsCounter, 4277 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2898 GetRequests, 2752 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 8.3s 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: 5.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 26985 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 15.0s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 2499 NumberOfCodeBlocks, 2477 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2871 ConstructedInterpolants, 0 QuantifiedInterpolants, 4296 SizeOfPredicates, 44 NumberOfNonLiveVariables, 22742 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-21 10:00:11,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample