./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 6c24879c 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-?-6c24879 [2022-07-12 11:21:48,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:21:48,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:21:48,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:21:48,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:21:48,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:21:48,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:21:48,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:21:48,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:21:48,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:21:48,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:21:48,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:21:48,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:21:48,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:21:48,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:21:48,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:21:48,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:21:48,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:21:48,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:21:48,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:21:48,623 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:21:48,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:21:48,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:21:48,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:21:48,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:21:48,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:21:48,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:21:48,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:21:48,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:21:48,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:21:48,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:21:48,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:21:48,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:21:48,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:21:48,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:21:48,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:21:48,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:21:48,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:21:48,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:21:48,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:21:48,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:21:48,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:21:48,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:21:48,660 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:21:48,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:21:48,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:21:48,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:21:48,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:21:48,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:21:48,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:21:48,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:21:48,662 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:21:48,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:21:48,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:21:48,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:21:48,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:21:48,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:21:48,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:21:48,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:21:48,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:21:48,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:21:48,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:21:48,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:21:48,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:21:48,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:48,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:21:48,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:21:48,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:21:48,667 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-12 11:21:48,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:21:48,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:21:48,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:21:48,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:21:48,877 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:21:48,878 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-12 11:21:48,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0fa0f82/9fa3eab198e2404d9aef19ff7df3d458/FLAGfe4435733 [2022-07-12 11:21:49,487 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:21:49,488 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-12 11:21:49,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0fa0f82/9fa3eab198e2404d9aef19ff7df3d458/FLAGfe4435733 [2022-07-12 11:21:49,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0fa0f82/9fa3eab198e2404d9aef19ff7df3d458 [2022-07-12 11:21:49,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:21:49,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:21:49,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:49,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:21:49,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:21:49,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:49" (1/1) ... [2022-07-12 11:21:49,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281f19ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:49, skipping insertion in model container [2022-07-12 11:21:49,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:49" (1/1) ... [2022-07-12 11:21:49,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:21:50,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:21:50,733 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-12 11:21:50,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:50,827 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:21:50,987 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-12 11:21:51,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:51,154 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:21:51,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51 WrapperNode [2022-07-12 11:21:51,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:51,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:51,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:21:51,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:21:51,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,273 INFO L137 Inliner]: procedures = 133, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1375 [2022-07-12 11:21:51,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:51,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:21:51,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:21:51,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:21:51,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:21:51,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:21:51,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:21:51,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:21:51,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (1/1) ... [2022-07-12 11:21:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:21:51,377 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-12 11:21:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 11:21:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 11:21:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-12 11:21:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-12 11:21:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:21:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:21:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:21:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 11:21:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-12 11:21:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:21:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:21:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:21:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:21:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-12 11:21:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-12 11:21:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-12 11:21:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-12 11:21:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:21:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:21:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-12 11:21:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-12 11:21:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:21:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 11:21:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 11:21:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:21:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:21:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:21:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:21:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 11:21:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 11:21:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-12 11:21:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-12 11:21:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:21:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-12 11:21:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-12 11:21:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:21:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 11:21:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 11:21:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:21:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:21:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-12 11:21:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-12 11:21:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 11:21:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 11:21:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-12 11:21:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-12 11:21:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:21:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-12 11:21:51,410 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-12 11:21:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:21:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:21:51,395 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-12 11:21:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-12 11:21:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-12 11:21:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:21:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:21:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:21:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:21:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 11:21:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-12 11:21:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:21:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:21:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:21:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:21:51,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:21:51,695 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:21:51,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:21:51,938 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:21:52,054 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:53,458 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-12 11:21:53,458 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-12 11:21:53,473 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:21:53,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:21:53,481 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-12 11:21:53,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:53 BoogieIcfgContainer [2022-07-12 11:21:53,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:21:53,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:21:53,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:21:53,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:21:53,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:21:49" (1/3) ... [2022-07-12 11:21:53,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22474a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:53, skipping insertion in model container [2022-07-12 11:21:53,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:51" (2/3) ... [2022-07-12 11:21:53,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22474a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:53, skipping insertion in model container [2022-07-12 11:21:53,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:53" (3/3) ... [2022-07-12 11:21:53,495 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-12 11:21:53,504 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:21:53,505 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:21:53,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:21:53,554 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@25919600, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58ea8231 [2022-07-12 11:21:53,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:21:53,559 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-12 11:21:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 11:21:53,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:53,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:53,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-12 11:21:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:53,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819523740] [2022-07-12 11:21:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:53,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:53,895 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-12 11:21:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:53,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819523740] [2022-07-12 11:21:53,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819523740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:53,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:53,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730356239] [2022-07-12 11:21:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:53,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:53,936 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-12 11:21:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:54,128 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-12 11:21:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:54,130 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-12 11:21:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:54,158 INFO L225 Difference]: With dead ends: 1253 [2022-07-12 11:21:54,161 INFO L226 Difference]: Without dead ends: 824 [2022-07-12 11:21:54,168 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-12 11:21:54,172 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-12 11:21:54,172 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-12 11:21:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-12 11:21:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-12 11:21:54,301 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-12 11:21:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-12 11:21:54,313 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-12 11:21:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:54,314 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-12 11:21:54,314 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-12 11:21:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-12 11:21:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:21:54,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:54,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:21:54,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-12 11:21:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:54,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364128528] [2022-07-12 11:21:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,437 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-12 11:21:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364128528] [2022-07-12 11:21:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364128528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137594882] [2022-07-12 11:21:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:54,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:54,445 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-12 11:21:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:54,575 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-12 11:21:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:54,576 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-12 11:21:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:54,587 INFO L225 Difference]: With dead ends: 2433 [2022-07-12 11:21:54,587 INFO L226 Difference]: Without dead ends: 1617 [2022-07-12 11:21:54,592 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-12 11:21:54,593 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-12 11:21:54,594 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-12 11:21:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-12 11:21:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-12 11:21:54,653 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-12 11:21:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-12 11:21:54,661 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-12 11:21:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:54,661 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-12 11:21:54,661 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-12 11:21:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-12 11:21:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:21:54,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:54,668 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-12 11:21:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:21:54,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-12 11:21:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:54,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185782608] [2022-07-12 11:21:54,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:21:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:21:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:21:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:21:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:21:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:21:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:54,857 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-12 11:21:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185782608] [2022-07-12 11:21:54,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185782608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:54,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:54,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:21:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717980589] [2022-07-12 11:21:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:54,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:21:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:21:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:54,860 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-12 11:21:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:56,890 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2022-07-12 11:21:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:21:56,891 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-12 11:21:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:56,897 INFO L225 Difference]: With dead ends: 3324 [2022-07-12 11:21:56,897 INFO L226 Difference]: Without dead ends: 1722 [2022-07-12 11:21:56,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:21:56,901 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 235 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:56,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1966 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 11:21:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-07-12 11:21:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2022-07-12 11:21:56,940 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-12 11:21:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-12 11:21:56,946 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-12 11:21:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:56,946 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-12 11:21:56,946 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-12 11:21:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-12 11:21:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:21:56,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:56,948 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-12 11:21:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:21:56,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-12 11:21:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:56,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715859011] [2022-07-12 11:21:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:21:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:21:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:21:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:21:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:21:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:21:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,049 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-12 11:21:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:57,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715859011] [2022-07-12 11:21:57,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715859011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:57,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:57,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:21:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221949099] [2022-07-12 11:21:57,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:57,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:21:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:21:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:21:57,065 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-12 11:21:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:59,070 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2022-07-12 11:21:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:21:59,071 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-12 11:21:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:59,080 INFO L225 Difference]: With dead ends: 4036 [2022-07-12 11:21:59,080 INFO L226 Difference]: Without dead ends: 2437 [2022-07-12 11:21:59,084 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-12 11:21:59,085 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 437 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:59,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1374 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 11:21:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-12 11:21:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2022-07-12 11:21:59,143 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-12 11:21:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-12 11:21:59,152 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-12 11:21:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:59,153 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-12 11:21:59,153 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-12 11:21:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-12 11:21:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 11:21:59,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:59,155 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-12 11:21:59,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:21:59,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:59,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-12 11:21:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:59,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6624431] [2022-07-12 11:21:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:21:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:21:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:21:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:21:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:21:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,299 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-12 11:21:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:59,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6624431] [2022-07-12 11:21:59,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6624431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:59,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:59,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:21:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866180694] [2022-07-12 11:21:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:21:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:21:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:21:59,302 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-12 11:22:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:00,184 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2022-07-12 11:22:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:22:00,185 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-12 11:22:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:00,200 INFO L225 Difference]: With dead ends: 6341 [2022-07-12 11:22:00,200 INFO L226 Difference]: Without dead ends: 4040 [2022-07-12 11:22:00,207 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-12 11:22:00,208 INFO L413 NwaCegarLoop]: 869 mSDtfsCounter, 564 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:00,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2632 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:22:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-07-12 11:22:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2022-07-12 11:22:00,312 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-12 11:22:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2022-07-12 11:22:00,321 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2022-07-12 11:22:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:00,322 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2022-07-12 11:22:00,322 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-12 11:22:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2022-07-12 11:22:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:22:00,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:00,325 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-12 11:22:00,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:22:00,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-12 11:22:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987624144] [2022-07-12 11:22:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,450 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-12 11:22:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:00,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987624144] [2022-07-12 11:22:00,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987624144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:00,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:22:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739273234] [2022-07-12 11:22:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:22:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:22:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:22:00,455 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-12 11:22:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:01,204 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2022-07-12 11:22:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:22:01,204 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-12 11:22:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:01,218 INFO L225 Difference]: With dead ends: 5919 [2022-07-12 11:22:01,218 INFO L226 Difference]: Without dead ends: 3584 [2022-07-12 11:22:01,223 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-12 11:22:01,224 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 453 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:01,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2500 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:22:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2022-07-12 11:22:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2022-07-12 11:22:01,298 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-12 11:22:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2022-07-12 11:22:01,303 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2022-07-12 11:22:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:01,304 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2022-07-12 11:22:01,304 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-12 11:22:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2022-07-12 11:22:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:22:01,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:01,305 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-12 11:22:01,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:22:01,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-12 11:22:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:01,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756350313] [2022-07-12 11:22:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:01,483 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-12 11:22:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:01,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756350313] [2022-07-12 11:22:01,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756350313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:01,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:01,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:22:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383469173] [2022-07-12 11:22:01,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:01,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:22:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:22:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:01,485 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-12 11:22:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:02,466 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2022-07-12 11:22:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:02,467 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-12 11:22:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:02,475 INFO L225 Difference]: With dead ends: 3619 [2022-07-12 11:22:02,475 INFO L226 Difference]: Without dead ends: 2425 [2022-07-12 11:22:02,478 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-12 11:22:02,479 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 117 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-12 11:22:02,479 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-12 11:22:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-07-12 11:22:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2022-07-12 11:22:02,536 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-12 11:22:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-12 11:22:02,541 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-12 11:22:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:02,541 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-12 11:22:02,542 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-12 11:22:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-12 11:22:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:22:02,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:02,543 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-12 11:22:02,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:22:02,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-12 11:22:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:02,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877914940] [2022-07-12 11:22:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,677 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-12 11:22:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:02,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877914940] [2022-07-12 11:22:02,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877914940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:02,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:02,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:22:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97968314] [2022-07-12 11:22:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:22:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:22:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:02,680 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-12 11:22:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:04,007 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2022-07-12 11:22:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:22:04,008 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-12 11:22:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:04,019 INFO L225 Difference]: With dead ends: 5577 [2022-07-12 11:22:04,020 INFO L226 Difference]: Without dead ends: 3212 [2022-07-12 11:22:04,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:04,025 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 448 mSDsluCounter, 5508 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 6418 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-12 11:22:04,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 6418 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 11:22:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-07-12 11:22:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2022-07-12 11:22:04,091 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-12 11:22:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-12 11:22:04,097 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-12 11:22:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:04,097 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-12 11:22:04,097 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-12 11:22:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-12 11:22:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 11:22:04,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:04,098 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-12 11:22:04,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:22:04,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2022-07-12 11:22:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50842149] [2022-07-12 11:22:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,232 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-12 11:22:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50842149] [2022-07-12 11:22:04,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50842149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:04,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:04,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:22:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876646428] [2022-07-12 11:22:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:04,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:22:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:04,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:22:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:04,261 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-12 11:22:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:05,533 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2022-07-12 11:22:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:05,534 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-12 11:22:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:05,548 INFO L225 Difference]: With dead ends: 5739 [2022-07-12 11:22:05,548 INFO L226 Difference]: Without dead ends: 3370 [2022-07-12 11:22:05,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:05,554 INFO L413 NwaCegarLoop]: 815 mSDtfsCounter, 397 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 3673 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:05,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 3673 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:22:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-07-12 11:22:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2022-07-12 11:22:05,644 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-12 11:22:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2022-07-12 11:22:05,650 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2022-07-12 11:22:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:05,651 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2022-07-12 11:22:05,651 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-12 11:22:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2022-07-12 11:22:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 11:22:05,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:05,654 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-12 11:22:05,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:22:05,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-12 11:22:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:05,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439110987] [2022-07-12 11:22:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,821 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-12 11:22:05,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:05,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439110987] [2022-07-12 11:22:05,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439110987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:05,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:05,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:22:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026357340] [2022-07-12 11:22:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:05,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:22:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:22:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:05,823 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-12 11:22:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:07,527 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2022-07-12 11:22:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:22:07,528 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-12 11:22:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:07,539 INFO L225 Difference]: With dead ends: 3452 [2022-07-12 11:22:07,540 INFO L226 Difference]: Without dead ends: 3447 [2022-07-12 11:22:07,541 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-12 11:22:07,541 INFO L413 NwaCegarLoop]: 919 mSDtfsCounter, 2408 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 1155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1155 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:07,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 2310 Invalid, 2727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1155 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 11:22:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-07-12 11:22:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2022-07-12 11:22:07,636 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-12 11:22:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2022-07-12 11:22:07,643 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2022-07-12 11:22:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:07,644 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2022-07-12 11:22:07,644 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-12 11:22:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2022-07-12 11:22:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:22:07,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:07,646 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-12 11:22:07,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:22:07,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -418091033, now seen corresponding path program 1 times [2022-07-12 11:22:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188836584] [2022-07-12 11:22:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:22:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,914 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-12 11:22:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:07,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188836584] [2022-07-12 11:22:07,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188836584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:07,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:07,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:22:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320696901] [2022-07-12 11:22:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:22:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:22:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:07,917 INFO L87 Difference]: Start difference. First operand 3363 states and 4685 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:22:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:09,005 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2022-07-12 11:22:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:22:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-12 11:22:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:09,033 INFO L225 Difference]: With dead ends: 7643 [2022-07-12 11:22:09,034 INFO L226 Difference]: Without dead ends: 4292 [2022-07-12 11:22:09,041 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-12 11:22:09,042 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 599 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:09,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2774 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:22:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-07-12 11:22:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2022-07-12 11:22:09,150 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-12 11:22:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2022-07-12 11:22:09,156 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2022-07-12 11:22:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:09,157 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2022-07-12 11:22:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:22:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2022-07-12 11:22:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 11:22:09,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:09,159 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-12 11:22:09,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:22:09,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:09,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2022-07-12 11:22:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:09,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623987465] [2022-07-12 11:22:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:22:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:22:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:22:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,393 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-12 11:22:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:09,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623987465] [2022-07-12 11:22:09,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623987465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:09,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:09,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:22:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462534643] [2022-07-12 11:22:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:09,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:22:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:22:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:09,395 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-12 11:22:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:10,977 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2022-07-12 11:22:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:22:10,977 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-12 11:22:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:10,989 INFO L225 Difference]: With dead ends: 6776 [2022-07-12 11:22:10,993 INFO L226 Difference]: Without dead ends: 4370 [2022-07-12 11:22:11,000 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-12 11:22:11,001 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 433 mSDsluCounter, 5122 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 5926 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:11,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 5926 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 11:22:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2022-07-12 11:22:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2022-07-12 11:22:11,178 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-12 11:22:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2022-07-12 11:22:11,184 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2022-07-12 11:22:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:11,184 INFO L495 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2022-07-12 11:22:11,184 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-12 11:22:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2022-07-12 11:22:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:22:11,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:11,186 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-12 11:22:11,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:22:11,187 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-12 11:22:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:11,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697260089] [2022-07-12 11:22:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,402 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-12 11:22:11,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:11,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697260089] [2022-07-12 11:22:11,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697260089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:11,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:11,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:22:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547293265] [2022-07-12 11:22:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:11,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:22:11,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:22:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:11,403 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-12 11:22:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:12,315 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2022-07-12 11:22:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:22:12,316 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-12 11:22:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:12,327 INFO L225 Difference]: With dead ends: 6262 [2022-07-12 11:22:12,328 INFO L226 Difference]: Without dead ends: 3856 [2022-07-12 11:22:12,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:12,335 INFO L413 NwaCegarLoop]: 812 mSDtfsCounter, 513 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:12,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 2820 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:22:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2022-07-12 11:22:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2022-07-12 11:22:12,510 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-12 11:22:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2022-07-12 11:22:12,516 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2022-07-12 11:22:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:12,516 INFO L495 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2022-07-12 11:22:12,516 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-12 11:22:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2022-07-12 11:22:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:22:12,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:12,520 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-12 11:22:12,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 11:22:12,520 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-12 11:22:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:12,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748476026] [2022-07-12 11:22:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,726 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-12 11:22:12,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:12,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748476026] [2022-07-12 11:22:12,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748476026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:12,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:12,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:22:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068522397] [2022-07-12 11:22:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:12,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:12,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:12,729 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-12 11:22:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:13,852 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2022-07-12 11:22:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:22:13,852 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-12 11:22:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:13,859 INFO L225 Difference]: With dead ends: 3905 [2022-07-12 11:22:13,859 INFO L226 Difference]: Without dead ends: 2681 [2022-07-12 11:22:13,862 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-12 11:22:13,863 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 340 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:13,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2523 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:22:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-07-12 11:22:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2022-07-12 11:22:13,951 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-12 11:22:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2022-07-12 11:22:13,957 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2022-07-12 11:22:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:13,958 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2022-07-12 11:22:13,958 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-12 11:22:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2022-07-12 11:22:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:22:13,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:13,960 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-12 11:22:13,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:22:13,960 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-12 11:22:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185219033] [2022-07-12 11:22:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,062 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-12 11:22:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185219033] [2022-07-12 11:22:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185219033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:14,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:14,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:22:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825836485] [2022-07-12 11:22:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:14,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:22:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:14,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:22:14,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:22:14,064 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-12 11:22:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:14,838 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2022-07-12 11:22:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:22:14,838 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-12 11:22:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:14,846 INFO L225 Difference]: With dead ends: 4660 [2022-07-12 11:22:14,846 INFO L226 Difference]: Without dead ends: 3432 [2022-07-12 11:22:14,850 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-12 11:22:14,852 INFO L413 NwaCegarLoop]: 832 mSDtfsCounter, 426 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2109 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:14,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2109 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:22:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-07-12 11:22:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2022-07-12 11:22:14,942 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-12 11:22:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2022-07-12 11:22:14,947 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2022-07-12 11:22:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:14,948 INFO L495 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2022-07-12 11:22:14,948 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-12 11:22:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2022-07-12 11:22:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:22:14,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:14,950 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-12 11:22:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:22:14,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-12 11:22:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754188979] [2022-07-12 11:22:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:22:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:22:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:22:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:22:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:22:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,054 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-12 11:22:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:15,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754188979] [2022-07-12 11:22:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754188979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:15,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:15,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:22:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427080283] [2022-07-12 11:22:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:15,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:22:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:15,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:22:15,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:22:15,057 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-12 11:22:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:16,520 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2022-07-12 11:22:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:16,521 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-12 11:22:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:16,528 INFO L225 Difference]: With dead ends: 5424 [2022-07-12 11:22:16,528 INFO L226 Difference]: Without dead ends: 2778 [2022-07-12 11:22:16,532 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-12 11:22:16,533 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 247 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:16,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1644 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 11:22:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-07-12 11:22:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2022-07-12 11:22:16,626 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-12 11:22:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2022-07-12 11:22:16,633 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2022-07-12 11:22:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:16,633 INFO L495 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2022-07-12 11:22:16,633 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-12 11:22:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2022-07-12 11:22:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 11:22:16,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:16,635 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-12 11:22:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:22:16,635 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-12 11:22:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932666889] [2022-07-12 11:22:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:22:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,879 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-12 11:22:16,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:16,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932666889] [2022-07-12 11:22:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932666889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:22:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520479611] [2022-07-12 11:22:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:16,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:22:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:22:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:16,881 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-12 11:22:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:19,072 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2022-07-12 11:22:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:22:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 89 [2022-07-12 11:22:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:19,098 INFO L225 Difference]: With dead ends: 3982 [2022-07-12 11:22:19,099 INFO L226 Difference]: Without dead ends: 3979 [2022-07-12 11:22:19,101 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-12 11:22:19,101 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 2074 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:19,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 2903 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 11:22:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2022-07-12 11:22:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2022-07-12 11:22:19,435 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-12 11:22:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2022-07-12 11:22:19,457 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2022-07-12 11:22:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:19,457 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2022-07-12 11:22:19,457 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-12 11:22:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2022-07-12 11:22:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:22:19,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:19,460 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-12 11:22:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:22:19,460 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-12 11:22:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:19,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326016986] [2022-07-12 11:22:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:22:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,740 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-12 11:22:19,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326016986] [2022-07-12 11:22:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326016986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210302674] [2022-07-12 11:22:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:19,759 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-12 11:22:19,807 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-12 11:22:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 11:22:20,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:20,406 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-12 11:22:20,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:20,535 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-12 11:22:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210302674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:20,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-07-12 11:22:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957640399] [2022-07-12 11:22:20,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 11:22:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 11:22:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:22:20,537 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-12 11:22:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:25,258 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2022-07-12 11:22:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 11:22:25,258 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-12 11:22:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:25,284 INFO L225 Difference]: With dead ends: 11133 [2022-07-12 11:22:25,284 INFO L226 Difference]: Without dead ends: 7266 [2022-07-12 11:22:25,298 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-12 11:22:25,299 INFO L413 NwaCegarLoop]: 929 mSDtfsCounter, 1009 mSDsluCounter, 12665 mSDsCounter, 0 mSdLazyCounter, 7763 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 13594 SdHoareTripleChecker+Invalid, 8333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 7763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:25,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 13594 Invalid, 8333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 7763 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 11:22:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2022-07-12 11:22:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2022-07-12 11:22:25,544 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-12 11:22:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2022-07-12 11:22:25,553 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2022-07-12 11:22:25,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:25,553 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2022-07-12 11:22:25,553 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-12 11:22:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2022-07-12 11:22:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:22:25,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:25,555 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-12 11:22:25,587 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-12 11:22:25,775 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-12 11:22:25,775 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2022-07-12 11:22:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:25,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530804985] [2022-07-12 11:22:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:22:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:22:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:22:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,018 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-12 11:22:26,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:26,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530804985] [2022-07-12 11:22:26,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530804985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:26,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:26,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:22:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115802955] [2022-07-12 11:22:26,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:26,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:22:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:22:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:26,021 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-12 11:22:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:28,457 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2022-07-12 11:22:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:22:28,460 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-12 11:22:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:28,524 INFO L225 Difference]: With dead ends: 10144 [2022-07-12 11:22:28,539 INFO L226 Difference]: Without dead ends: 8384 [2022-07-12 11:22:28,547 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-12 11:22:28,548 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 1947 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:28,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 3754 Invalid, 3449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 11:22:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2022-07-12 11:22:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2022-07-12 11:22:29,004 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-12 11:22:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2022-07-12 11:22:29,028 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2022-07-12 11:22:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:29,029 INFO L495 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2022-07-12 11:22:29,029 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-12 11:22:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2022-07-12 11:22:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 11:22:29,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:29,031 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-12 11:22:29,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:22:29,031 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-12 11:22:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:29,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388201284] [2022-07-12 11:22:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:22:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:22:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:22:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,215 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-12 11:22:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:29,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388201284] [2022-07-12 11:22:29,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388201284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:29,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:29,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:22:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146114929] [2022-07-12 11:22:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:29,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:22:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:22:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:29,218 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-12 11:22:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:31,636 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2022-07-12 11:22:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:22:31,637 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-12 11:22:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:31,665 INFO L225 Difference]: With dead ends: 17611 [2022-07-12 11:22:31,666 INFO L226 Difference]: Without dead ends: 10847 [2022-07-12 11:22:31,678 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-12 11:22:31,679 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 462 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 3122 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 6440 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:31,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 6440 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 11:22:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2022-07-12 11:22:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2022-07-12 11:22:32,038 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-12 11:22:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2022-07-12 11:22:32,063 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2022-07-12 11:22:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2022-07-12 11:22:32,063 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-12 11:22:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2022-07-12 11:22:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:22:32,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:32,065 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-12 11:22:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 11:22:32,066 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-12 11:22:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929278235] [2022-07-12 11:22:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:22:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:22:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:22:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:22:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:22:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:22:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,292 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-12 11:22:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:32,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929278235] [2022-07-12 11:22:32,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929278235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:32,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679666146] [2022-07-12 11:22:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:32,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:32,308 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-12 11:22:32,309 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-12 11:22:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:32,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:32,752 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-12 11:22:32,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:32,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679666146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:32,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:32,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 11:22:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097690535] [2022-07-12 11:22:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:32,753 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-12 11:22:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:33,170 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2022-07-12 11:22:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:33,171 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-12 11:22:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:33,191 INFO L225 Difference]: With dead ends: 16288 [2022-07-12 11:22:33,191 INFO L226 Difference]: Without dead ends: 8174 [2022-07-12 11:22:33,205 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-12 11:22:33,206 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-12 11:22:33,206 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-12 11:22:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2022-07-12 11:22:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2022-07-12 11:22:33,579 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-12 11:22:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2022-07-12 11:22:33,601 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2022-07-12 11:22:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:33,602 INFO L495 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2022-07-12 11:22:33,602 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-12 11:22:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2022-07-12 11:22:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:22:33,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:33,604 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-12 11:22:33,641 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-12 11:22:33,823 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-12 11:22:33,823 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2022-07-12 11:22:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533495206] [2022-07-12 11:22:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:22:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:22:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:22:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:22:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:22:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:22:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,040 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-12 11:22:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533495206] [2022-07-12 11:22:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533495206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:22:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216439319] [2022-07-12 11:22:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:34,042 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-12 11:22:39,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:22:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:40,278 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2022-07-12 11:22:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:40,279 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-12 11:22:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:40,310 INFO L225 Difference]: With dead ends: 18980 [2022-07-12 11:22:40,310 INFO L226 Difference]: Without dead ends: 12202 [2022-07-12 11:22:40,326 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-12 11:22:40,327 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 505 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:40,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 3691 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 11:22:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2022-07-12 11:22:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2022-07-12 11:22:40,754 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-12 11:22:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2022-07-12 11:22:40,774 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2022-07-12 11:22:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:40,774 INFO L495 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2022-07-12 11:22:40,774 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-12 11:22:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2022-07-12 11:22:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 11:22:40,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:40,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:40,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:22:40,778 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-12 11:22:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:40,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177574081] [2022-07-12 11:22:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:22:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:22:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:22:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:22:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:22:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,997 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-12 11:22:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:40,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177574081] [2022-07-12 11:22:40,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177574081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:40,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:40,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:22:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093721688] [2022-07-12 11:22:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:40,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:22:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:22:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:40,999 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-12 11:22:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:43,739 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2022-07-12 11:22:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:22:43,739 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-12 11:22:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:43,761 INFO L225 Difference]: With dead ends: 15028 [2022-07-12 11:22:43,761 INFO L226 Difference]: Without dead ends: 10127 [2022-07-12 11:22:43,769 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-12 11:22:43,770 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 559 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6151 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:43,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 6151 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 11:22:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2022-07-12 11:22:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2022-07-12 11:22:44,092 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-12 11:22:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2022-07-12 11:22:44,108 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2022-07-12 11:22:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:44,109 INFO L495 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2022-07-12 11:22:44,109 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-12 11:22:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2022-07-12 11:22:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 11:22:44,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:44,111 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-12 11:22:44,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 11:22:44,111 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2022-07-12 11:22:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368373382] [2022-07-12 11:22:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:22:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:22:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:22:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:22:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:22:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,267 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-12 11:22:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368373382] [2022-07-12 11:22:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368373382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171999546] [2022-07-12 11:22:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:44,269 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-12 11:22:44,304 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-12 11:22:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:44,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:44,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:44,764 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-12 11:22:44,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:44,821 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-12 11:22:44,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171999546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:44,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:44,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2022-07-12 11:22:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859082752] [2022-07-12 11:22:44,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:44,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:22:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:22:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:44,823 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-12 11:22:47,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:22:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:48,427 INFO L93 Difference]: Finished difference Result 14665 states and 19980 transitions. [2022-07-12 11:22:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:22:48,427 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-12 11:22:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:48,446 INFO L225 Difference]: With dead ends: 14665 [2022-07-12 11:22:48,446 INFO L226 Difference]: Without dead ends: 7538 [2022-07-12 11:22:48,462 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-12 11:22:48,462 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 243 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:48,463 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.2s Time] [2022-07-12 11:22:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-07-12 11:22:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7268. [2022-07-12 11:22:48,808 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-12 11:22:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 9842 transitions. [2022-07-12 11:22:48,826 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 9842 transitions. Word has length 111 [2022-07-12 11:22:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:48,826 INFO L495 AbstractCegarLoop]: Abstraction has 7268 states and 9842 transitions. [2022-07-12 11:22:48,827 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-12 11:22:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 9842 transitions. [2022-07-12 11:22:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 11:22:48,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:48,829 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-12 11:22:48,863 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-12 11:22:49,048 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-12 11:22:49,049 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 800394672, now seen corresponding path program 1 times [2022-07-12 11:22:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723846650] [2022-07-12 11:22:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:22:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:22:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:22:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:22:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:22:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,336 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-12 11:22:49,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723846650] [2022-07-12 11:22:49,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723846650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:49,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:49,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:22:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886929354] [2022-07-12 11:22:49,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:49,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:22:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:22:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:49,338 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-12 11:22:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:51,949 INFO L93 Difference]: Finished difference Result 13334 states and 18523 transitions. [2022-07-12 11:22:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:22:51,949 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-12 11:22:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:51,978 INFO L225 Difference]: With dead ends: 13334 [2022-07-12 11:22:51,978 INFO L226 Difference]: Without dead ends: 10002 [2022-07-12 11:22:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:22:51,992 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 655 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 5643 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:51,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 5643 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 11:22:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2022-07-12 11:22:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 7266. [2022-07-12 11:22:52,469 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-12 11:22:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 9824 transitions. [2022-07-12 11:22:52,507 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 9824 transitions. Word has length 121 [2022-07-12 11:22:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:52,508 INFO L495 AbstractCegarLoop]: Abstraction has 7266 states and 9824 transitions. [2022-07-12 11:22:52,508 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-12 11:22:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 9824 transitions. [2022-07-12 11:22:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:22:52,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:52,510 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-12 11:22:52,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 11:22:52,510 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-12 11:22:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:52,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490869382] [2022-07-12 11:22:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:52,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:22:52,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 11:22:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:22:52,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 11:22:52,803 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 11:22:52,804 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:22:52,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 11:22:52,807 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-12 11:22:52,810 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:22:52,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:22:52 BoogieIcfgContainer [2022-07-12 11:22:52,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:22:52,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:22:52,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:22:52,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:22:52,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:53" (3/4) ... [2022-07-12 11:22:52,923 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 11:22:52,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:22:52,924 INFO L158 Benchmark]: Toolchain (without parser) took 62965.86ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 72.7MB in the beginning and 996.1MB in the end (delta: -923.4MB). Peak memory consumption was 339.8MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,924 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 89.6MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:22:52,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1196.23ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 72.5MB in the beginning and 105.8MB in the end (delta: -33.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.19ms. Allocated memory is still 165.7MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,925 INFO L158 Benchmark]: Boogie Preprocessor took 72.02ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,927 INFO L158 Benchmark]: RCFGBuilder took 2132.82ms. Allocated memory was 165.7MB in the beginning and 272.6MB in the end (delta: 107.0MB). Free memory was 86.9MB in the beginning and 187.6MB in the end (delta: -100.7MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,927 INFO L158 Benchmark]: TraceAbstraction took 59435.82ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 187.6MB in the beginning and 996.1MB in the end (delta: -808.4MB). Peak memory consumption was 299.9MB. Max. memory is 16.1GB. [2022-07-12 11:22:52,927 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 1.4GB. Free memory is still 996.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:22:52,931 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 117.4MB. Free memory was 89.6MB in the beginning and 89.6MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1196.23ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 72.5MB in the beginning and 105.8MB in the end (delta: -33.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.19ms. Allocated memory is still 165.7MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.02ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2132.82ms. Allocated memory was 165.7MB in the beginning and 272.6MB in the end (delta: 107.0MB). Free memory was 86.9MB in the beginning and 187.6MB in the end (delta: -100.7MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * TraceAbstraction took 59435.82ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 187.6MB in the beginning and 996.1MB in the end (delta: -808.4MB). Peak memory consumption was 299.9MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 1.4GB. Free memory is still 996.1MB. 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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:15}, 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: 59.3s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17418 SdHoareTripleChecker+Valid, 38.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16152 mSDsluCounter, 90363 SdHoareTripleChecker+Invalid, 33.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71655 mSDsCounter, 8243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40965 IncrementalHoareTripleChecker+Invalid, 49208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8243 mSolverCounterUnsat, 18708 mSDtfsCounter, 40965 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 27213 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 4947 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-12 11:22:52,968 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-?-6c24879 [2022-07-12 11:22:54,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:22:54,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:22:54,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:22:54,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:22:54,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:22:54,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:22:54,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:22:54,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:22:54,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:22:54,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:22:54,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:22:54,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:22:54,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:22:54,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:22:54,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:22:54,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:22:54,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:22:54,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:22:54,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:22:54,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:22:54,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:22:54,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:22:54,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:22:54,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:22:54,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:22:54,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:22:54,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:22:54,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:22:54,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:22:54,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:22:54,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:22:54,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:22:54,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:22:54,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:22:54,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:22:54,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:22:54,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:22:54,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:22:54,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:22:54,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:22:54,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:22:54,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:22:54,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:22:54,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:22:54,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:22:54,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:22:54,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:22:54,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:22:54,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:22:54,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:22:54,950 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:22:54,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:22:54,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:22:54,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:22:54,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:22:54,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:22:54,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:22:54,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:22:54,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:22:54,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:22:54,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:22:54,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:22:54,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:22:54,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:22:54,953 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-12 11:22:55,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:22:55,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:22:55,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:22:55,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:22:55,235 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:22:55,237 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-12 11:22:55,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7451e816/40e6809feb604219963cb60ece84bb03/FLAG42513b281 [2022-07-12 11:22:55,822 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:22:55,823 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-12 11:22:55,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7451e816/40e6809feb604219963cb60ece84bb03/FLAG42513b281 [2022-07-12 11:22:56,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7451e816/40e6809feb604219963cb60ece84bb03 [2022-07-12 11:22:56,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:22:56,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:22:56,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:22:56,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:22:56,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:22:56,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:22:56" (1/1) ... [2022-07-12 11:22:56,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d42aba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:56, skipping insertion in model container [2022-07-12 11:22:56,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:22:56" (1/1) ... [2022-07-12 11:22:56,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:22:56,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:22:56,854 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-12 11:22:56,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:22:56,936 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 11:22:56,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:22:57,144 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-12 11:22:57,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:22:57,170 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:22:57,336 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-12 11:22:57,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:22:57,466 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:22:57,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57 WrapperNode [2022-07-12 11:22:57,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:22:57,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:22:57,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:22:57,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:22:57,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,594 INFO L137 Inliner]: procedures = 148, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1342 [2022-07-12 11:22:57,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:22:57,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:22:57,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:22:57,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:22:57,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:22:57,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:22:57,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:22:57,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:22:57,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (1/1) ... [2022-07-12 11:22:57,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:22:57,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:57,781 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-12 11:22:57,803 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-12 11:22:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 11:22:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2022-07-12 11:22:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:22:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 11:22:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:22:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:22:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 11:22:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 11:22:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2022-07-12 11:22:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2022-07-12 11:22:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:22:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:22:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:22:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:22:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2022-07-12 11:22:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2022-07-12 11:22:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2022-07-12 11:22:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2022-07-12 11:22:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:22:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:22:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2022-07-12 11:22:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2022-07-12 11:22:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 11:22:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 11:22:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:22:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:22:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-12 11:22:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-12 11:22:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-12 11:22:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-12 11:22:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:22:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:22:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 11:22:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 11:22:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2022-07-12 11:22:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2022-07-12 11:22:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:22:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2022-07-12 11:22:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2022-07-12 11:22:57,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:22:57,819 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 11:22:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 11:22:57,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:22:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:22:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-12 11:22:57,820 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2022-07-12 11:22:57,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2022-07-12 11:22:57,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-12 11:22:57,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-12 11:22:57,821 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 11:22:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 11:22:57,821 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-12 11:22:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-12 11:22:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:22:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-12 11:22:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-12 11:22:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:22:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:22:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-07-12 11:22:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-07-12 11:22:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 11:22:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 11:22:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:22:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:22:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 11:22:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 11:22:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-12 11:22:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-12 11:22:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 11:22:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 11:22:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-07-12 11:22:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-07-12 11:22:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:22:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:22:57,826 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 11:22:57,826 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 11:22:57,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:22:57,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:22:57,827 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-12 11:22:57,827 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-12 11:22:57,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-12 11:22:57,827 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-12 11:22:57,828 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-12 11:22:57,828 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:22:57,828 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:22:57,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:22:57,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:22:58,217 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:22:58,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:22:59,115 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:23:01,353 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:23:09,666 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-07-12 11:23:09,667 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-07-12 11:23:09,785 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:23:09,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:23:09,804 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-12 11:23:09,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:23:09 BoogieIcfgContainer [2022-07-12 11:23:09,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:23:09,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:23:09,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:23:09,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:23:09,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:22:56" (1/3) ... [2022-07-12 11:23:09,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f98c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:23:09, skipping insertion in model container [2022-07-12 11:23:09,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:57" (2/3) ... [2022-07-12 11:23:09,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f98c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:23:09, skipping insertion in model container [2022-07-12 11:23:09,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:23:09" (3/3) ... [2022-07-12 11:23:09,813 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2022-07-12 11:23:09,824 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:23:09,825 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:23:09,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:23:09,907 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@19a5e960, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5064545c [2022-07-12 11:23:09,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:23:09,915 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-12 11:23:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 11:23:09,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:09,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:09,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:09,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2022-07-12 11:23:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:09,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090774374] [2022-07-12 11:23:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:09,958 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-12 11:23:09,961 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-12 11:23:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:10,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:10,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:10,516 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-12 11:23:10,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:10,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090774374] [2022-07-12 11:23:10,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090774374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:10,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:10,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:23:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616952416] [2022-07-12 11:23:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:10,546 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-12 11:23:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:10,673 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2022-07-12 11:23:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:10,675 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-12 11:23:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:10,687 INFO L225 Difference]: With dead ends: 1253 [2022-07-12 11:23:10,687 INFO L226 Difference]: Without dead ends: 824 [2022-07-12 11:23:10,692 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-12 11:23:10,694 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-12 11:23:10,695 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-12 11:23:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-12 11:23:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2022-07-12 11:23:10,762 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-12 11:23:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2022-07-12 11:23:10,768 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2022-07-12 11:23:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:10,769 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2022-07-12 11:23:10,769 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-12 11:23:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2022-07-12 11:23:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:23:10,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:10,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:10,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:23:10,982 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-12 11:23:10,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2022-07-12 11:23:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019315198] [2022-07-12 11:23:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:11,012 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-12 11:23:11,013 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-12 11:23:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:11,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:11,612 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-12 11:23:11,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:11,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019315198] [2022-07-12 11:23:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019315198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:11,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:11,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:23:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378460328] [2022-07-12 11:23:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:11,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:11,614 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-12 11:23:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:11,728 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2022-07-12 11:23:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:11,729 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-12 11:23:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:11,736 INFO L225 Difference]: With dead ends: 2433 [2022-07-12 11:23:11,736 INFO L226 Difference]: Without dead ends: 1617 [2022-07-12 11:23:11,738 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-12 11:23:11,739 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-12 11:23:11,739 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-12 11:23:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-12 11:23:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2022-07-12 11:23:11,784 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-12 11:23:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2022-07-12 11:23:11,792 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2022-07-12 11:23:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:11,792 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2022-07-12 11:23:11,792 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-12 11:23:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2022-07-12 11:23:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:23:11,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:11,796 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-12 11:23:11,821 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-12 11:23:12,008 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-12 11:23:12,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2022-07-12 11:23:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64908172] [2022-07-12 11:23:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:12,012 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-12 11:23:12,015 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-12 11:23:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:12,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 11:23:12,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:12,595 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-12 11:23:12,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:12,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64908172] [2022-07-12 11:23:12,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64908172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:12,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:23:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815142484] [2022-07-12 11:23:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:23:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:23:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:12,597 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-12 11:23:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:12,723 INFO L93 Difference]: Finished difference Result 3212 states and 4225 transitions. [2022-07-12 11:23:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:12,724 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-12 11:23:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:12,730 INFO L225 Difference]: With dead ends: 3212 [2022-07-12 11:23:12,731 INFO L226 Difference]: Without dead ends: 1610 [2022-07-12 11:23:12,734 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-12 11:23:12,736 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:12,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:23:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-07-12 11:23:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2022-07-12 11:23:12,779 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-12 11:23:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2022-07-12 11:23:12,785 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2022-07-12 11:23:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:12,786 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2022-07-12 11:23:12,786 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-12 11:23:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2022-07-12 11:23:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:23:12,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:12,792 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-12 11:23:12,822 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-12 11:23:13,024 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-12 11:23:13,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2022-07-12 11:23:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:13,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863694341] [2022-07-12 11:23:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:13,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:13,031 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-12 11:23:13,032 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-12 11:23:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:13,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:13,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:13,576 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-12 11:23:13,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:13,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:13,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863694341] [2022-07-12 11:23:13,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863694341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:13,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:13,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:23:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45258883] [2022-07-12 11:23:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:13,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:13,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:13,578 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-12 11:23:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:13,677 INFO L93 Difference]: Finished difference Result 3924 states and 5357 transitions. [2022-07-12 11:23:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:13,678 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-12 11:23:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:13,686 INFO L225 Difference]: With dead ends: 3924 [2022-07-12 11:23:13,686 INFO L226 Difference]: Without dead ends: 2325 [2022-07-12 11:23:13,690 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-12 11:23:13,690 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 206 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 11:23:13,691 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-12 11:23:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-07-12 11:23:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2313. [2022-07-12 11:23:13,739 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-12 11:23:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2022-07-12 11:23:13,751 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2022-07-12 11:23:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:13,752 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2022-07-12 11:23:13,752 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-12 11:23:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2022-07-12 11:23:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 11:23:13,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:13,754 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-12 11:23:13,770 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-12 11:23:13,970 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-12 11:23:13,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2022-07-12 11:23:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:13,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977456399] [2022-07-12 11:23:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:13,973 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-12 11:23:13,974 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-12 11:23:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:14,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:23:14,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:14,475 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-12 11:23:14,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:14,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977456399] [2022-07-12 11:23:14,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977456399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:14,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:14,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:23:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20693451] [2022-07-12 11:23:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:14,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:23:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:23:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:23:14,477 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-12 11:23:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:14,814 INFO L93 Difference]: Finished difference Result 6261 states and 9014 transitions. [2022-07-12 11:23:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:23:14,815 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-12 11:23:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:14,829 INFO L225 Difference]: With dead ends: 6261 [2022-07-12 11:23:14,829 INFO L226 Difference]: Without dead ends: 3960 [2022-07-12 11:23:14,834 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-12 11:23:14,834 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-12 11:23:14,835 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-12 11:23:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2022-07-12 11:23:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2329. [2022-07-12 11:23:14,902 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-12 11:23:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3240 transitions. [2022-07-12 11:23:14,910 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3240 transitions. Word has length 68 [2022-07-12 11:23:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:14,910 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 3240 transitions. [2022-07-12 11:23:14,910 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-12 11:23:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3240 transitions. [2022-07-12 11:23:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:23:14,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:14,912 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-12 11:23:14,932 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-12 11:23:15,127 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-12 11:23:15,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2022-07-12 11:23:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:15,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403987] [2022-07-12 11:23:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:15,130 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-12 11:23:15,131 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-12 11:23:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:15,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:23:15,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:15,637 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-12 11:23:15,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:15,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:15,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403987] [2022-07-12 11:23:15,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:15,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:15,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:23:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944025540] [2022-07-12 11:23:15,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:15,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:23:15,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:15,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:23:15,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:23:15,639 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-12 11:23:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:15,996 INFO L93 Difference]: Finished difference Result 5821 states and 8310 transitions. [2022-07-12 11:23:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:23:15,996 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-12 11:23:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:16,014 INFO L225 Difference]: With dead ends: 5821 [2022-07-12 11:23:16,015 INFO L226 Difference]: Without dead ends: 3504 [2022-07-12 11:23:16,024 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-12 11:23:16,025 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-12 11:23:16,025 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-12 11:23:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2022-07-12 11:23:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2345. [2022-07-12 11:23:16,119 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-12 11:23:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3256 transitions. [2022-07-12 11:23:16,129 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3256 transitions. Word has length 69 [2022-07-12 11:23:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3256 transitions. [2022-07-12 11:23:16,129 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-12 11:23:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3256 transitions. [2022-07-12 11:23:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:23:16,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:16,131 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-12 11:23:16,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:23:16,351 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-12 11:23:16,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2022-07-12 11:23:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761269780] [2022-07-12 11:23:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:16,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:16,355 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-12 11:23:16,357 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-12 11:23:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:16,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:23:16,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:17,457 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-12 11:23:17,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:17,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:17,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761269780] [2022-07-12 11:23:17,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761269780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:17,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:17,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:23:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874641441] [2022-07-12 11:23:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:17,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:23:17,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:17,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:23:17,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:17,459 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-12 11:23:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:17,726 INFO L93 Difference]: Finished difference Result 3553 states and 4967 transitions. [2022-07-12 11:23:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:23:17,727 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-12 11:23:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:17,738 INFO L225 Difference]: With dead ends: 3553 [2022-07-12 11:23:17,738 INFO L226 Difference]: Without dead ends: 2377 [2022-07-12 11:23:17,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:17,744 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:17,744 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-12 11:23:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-12 11:23:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2022-07-12 11:23:17,822 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-12 11:23:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2022-07-12 11:23:17,831 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2022-07-12 11:23:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:17,832 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2022-07-12 11:23:17,832 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-12 11:23:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2022-07-12 11:23:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 11:23:17,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:17,834 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-12 11:23:17,856 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-12 11:23:18,053 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-12 11:23:18,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2022-07-12 11:23:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:18,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706569572] [2022-07-12 11:23:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:18,057 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-12 11:23:18,058 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-12 11:23:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:18,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:23:18,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:19,169 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-12 11:23:19,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:19,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706569572] [2022-07-12 11:23:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706569572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:19,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:19,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:23:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262506851] [2022-07-12 11:23:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:19,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:23:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:23:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:23:19,173 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-12 11:23:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:20,348 INFO L93 Difference]: Finished difference Result 5537 states and 7892 transitions. [2022-07-12 11:23:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:23:20,349 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-12 11:23:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:20,362 INFO L225 Difference]: With dead ends: 5537 [2022-07-12 11:23:20,362 INFO L226 Difference]: Without dead ends: 3172 [2022-07-12 11:23:20,367 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-12 11:23:20,368 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 217 mSDsluCounter, 6888 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 7798 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:20,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 7798 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:23:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-07-12 11:23:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2381. [2022-07-12 11:23:20,446 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-12 11:23:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2022-07-12 11:23:20,453 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2022-07-12 11:23:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:20,453 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2022-07-12 11:23:20,454 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-12 11:23:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2022-07-12 11:23:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 11:23:20,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:20,457 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-12 11:23:20,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 11:23:20,672 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-12 11:23:20,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1395829828, now seen corresponding path program 1 times [2022-07-12 11:23:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:20,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810944456] [2022-07-12 11:23:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:20,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:20,696 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-12 11:23:20,697 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-12 11:23:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:21,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:23:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:21,439 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-12 11:23:21,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:21,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:21,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810944456] [2022-07-12 11:23:21,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810944456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:21,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:21,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:23:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292361888] [2022-07-12 11:23:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:23:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:23:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:21,443 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-12 11:23:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:21,757 INFO L93 Difference]: Finished difference Result 5691 states and 8110 transitions. [2022-07-12 11:23:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:21,758 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-12 11:23:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:21,769 INFO L225 Difference]: With dead ends: 5691 [2022-07-12 11:23:21,769 INFO L226 Difference]: Without dead ends: 3322 [2022-07-12 11:23:21,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:21,774 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 168 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:21,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 3050 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:23:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-07-12 11:23:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2171. [2022-07-12 11:23:21,861 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-12 11:23:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2982 transitions. [2022-07-12 11:23:21,869 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2982 transitions. Word has length 75 [2022-07-12 11:23:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:21,869 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 2982 transitions. [2022-07-12 11:23:21,870 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-12 11:23:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2982 transitions. [2022-07-12 11:23:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 11:23:21,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:21,873 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-12 11:23:21,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:23:22,089 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-12 11:23:22,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2022-07-12 11:23:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:22,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505442705] [2022-07-12 11:23:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:22,092 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-12 11:23:22,093 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-12 11:23:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:22,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:23:22,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:23,343 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-12 11:23:23,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:23,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:23,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505442705] [2022-07-12 11:23:23,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505442705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:23,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:23,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:23:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100904256] [2022-07-12 11:23:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:23:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:23:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:23:23,345 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-12 11:23:25,771 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-12 11:23:27,785 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-12 11:23:31,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:33,643 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-12 11:23:36,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:37,629 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-12 11:23:39,954 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-12 11:23:41,960 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-12 11:23:45,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:48,141 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-12 11:23:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:52,281 INFO L93 Difference]: Finished difference Result 5559 states and 7703 transitions. [2022-07-12 11:23:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:23:52,282 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-12 11:23:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:52,299 INFO L225 Difference]: With dead ends: 5559 [2022-07-12 11:23:52,299 INFO L226 Difference]: Without dead ends: 4349 [2022-07-12 11:23:52,304 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-12 11:23:52,304 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 1146 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 315 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:52,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2484 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1825 Invalid, 6 Unknown, 0 Unchecked, 28.5s Time] [2022-07-12 11:23:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2022-07-12 11:23:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 3357. [2022-07-12 11:23:52,482 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-12 11:23:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4649 transitions. [2022-07-12 11:23:52,489 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4649 transitions. Word has length 75 [2022-07-12 11:23:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:52,490 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4649 transitions. [2022-07-12 11:23:52,490 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-12 11:23:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4649 transitions. [2022-07-12 11:23:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:23:52,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:52,492 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-12 11:23:52,509 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-12 11:23:52,709 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-12 11:23:52,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash -418091033, now seen corresponding path program 1 times [2022-07-12 11:23:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:52,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652625994] [2022-07-12 11:23:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:52,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:52,712 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-12 11:23:52,713 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-12 11:23:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:53,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:23:53,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:53,305 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-12 11:23:53,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:53,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652625994] [2022-07-12 11:23:53,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652625994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:53,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:53,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:23:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584704021] [2022-07-12 11:23:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:53,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:53,308 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-12 11:23:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:53,415 INFO L93 Difference]: Finished difference Result 6708 states and 9388 transitions. [2022-07-12 11:23:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:53,416 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-12 11:23:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:53,427 INFO L225 Difference]: With dead ends: 6708 [2022-07-12 11:23:53,428 INFO L226 Difference]: Without dead ends: 3363 [2022-07-12 11:23:53,435 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-12 11:23:53,436 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-12 11:23:53,436 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-12 11:23:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-07-12 11:23:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3363. [2022-07-12 11:23:53,578 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-12 11:23:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4655 transitions. [2022-07-12 11:23:53,591 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4655 transitions. Word has length 94 [2022-07-12 11:23:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:53,591 INFO L495 AbstractCegarLoop]: Abstraction has 3363 states and 4655 transitions. [2022-07-12 11:23:53,592 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-12 11:23:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4655 transitions. [2022-07-12 11:23:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 11:23:53,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:53,599 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-12 11:23:53,625 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-12 11:23:53,815 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-12 11:23:53,816 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1449980852, now seen corresponding path program 1 times [2022-07-12 11:23:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:53,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325410757] [2022-07-12 11:23:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:53,818 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-12 11:23:53,819 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-12 11:23:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:54,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:23:54,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:54,544 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-12 11:23:54,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:23:54,829 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-12 11:23:54,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325410757] [2022-07-12 11:23:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325410757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:23:54,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:23:54,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 11:23:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862645752] [2022-07-12 11:23:54,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:23:54,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:23:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:23:54,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:23:54,830 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-12 11:23:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:55,136 INFO L93 Difference]: Finished difference Result 6732 states and 9424 transitions. [2022-07-12 11:23:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:23:55,137 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-12 11:23:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:55,149 INFO L225 Difference]: With dead ends: 6732 [2022-07-12 11:23:55,149 INFO L226 Difference]: Without dead ends: 3381 [2022-07-12 11:23:55,158 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-12 11:23:55,159 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-12 11:23:55,160 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-12 11:23:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-12 11:23:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3381. [2022-07-12 11:23:55,298 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-12 11:23:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4673 transitions. [2022-07-12 11:23:55,308 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4673 transitions. Word has length 95 [2022-07-12 11:23:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:55,308 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4673 transitions. [2022-07-12 11:23:55,308 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-12 11:23:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4673 transitions. [2022-07-12 11:23:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 11:23:55,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:55,311 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-12 11:23:55,339 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-12 11:23:55,539 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-12 11:23:55,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1398514888, now seen corresponding path program 1 times [2022-07-12 11:23:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:55,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162919198] [2022-07-12 11:23:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:55,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:55,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:55,542 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-12 11:23:55,543 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-12 11:23:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:56,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:23:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:56,295 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-12 11:23:56,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:56,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:56,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162919198] [2022-07-12 11:23:56,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162919198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:56,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:56,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:23:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766257921] [2022-07-12 11:23:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:56,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:23:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:56,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:23:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:56,296 INFO L87 Difference]: Start difference. First operand 3381 states and 4673 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-12 11:23:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:57,220 INFO L93 Difference]: Finished difference Result 8271 states and 11707 transitions. [2022-07-12 11:23:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:57,221 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-12 11:23:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:57,233 INFO L225 Difference]: With dead ends: 8271 [2022-07-12 11:23:57,234 INFO L226 Difference]: Without dead ends: 4902 [2022-07-12 11:23:57,242 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-12 11:23:57,242 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 173 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:57,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2838 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:23:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-07-12 11:23:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 3271. [2022-07-12 11:23:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2368 states have (on average 1.2694256756756757) internal successors, (3006), 2383 states have internal predecessors, (3006), 706 states have call successors, (706), 179 states have call predecessors, (706), 196 states have return successors, (794), 728 states have call predecessors, (794), 702 states have call successors, (794) [2022-07-12 11:23:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4506 transitions. [2022-07-12 11:23:57,374 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4506 transitions. Word has length 98 [2022-07-12 11:23:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:57,374 INFO L495 AbstractCegarLoop]: Abstraction has 3271 states and 4506 transitions. [2022-07-12 11:23:57,374 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-12 11:23:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4506 transitions. [2022-07-12 11:23:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:23:57,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:57,376 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-12 11:23:57,405 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-12 11:23:57,593 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-12 11:23:57,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2022-07-12 11:23:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:57,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317863612] [2022-07-12 11:23:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:57,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:57,596 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-12 11:23:57,597 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-12 11:23:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:58,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:23:58,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:58,343 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-12 11:23:58,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:58,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317863612] [2022-07-12 11:23:58,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317863612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:58,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:58,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:23:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133727213] [2022-07-12 11:23:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:58,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:23:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:23:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:58,345 INFO L87 Difference]: Start difference. First operand 3271 states and 4506 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-12 11:23:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:58,667 INFO L93 Difference]: Finished difference Result 8013 states and 11362 transitions. [2022-07-12 11:23:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:58,669 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-12 11:23:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:58,681 INFO L225 Difference]: With dead ends: 8013 [2022-07-12 11:23:58,681 INFO L226 Difference]: Without dead ends: 4754 [2022-07-12 11:23:58,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:58,690 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-12 11:23:58,690 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-12 11:23:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-07-12 11:23:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 3087. [2022-07-12 11:23:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2240 states have (on average 1.2633928571428572) internal successors, (2830), 2243 states have internal predecessors, (2830), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 682 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-12 11:23:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4224 transitions. [2022-07-12 11:23:58,860 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4224 transitions. Word has length 87 [2022-07-12 11:23:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:58,860 INFO L495 AbstractCegarLoop]: Abstraction has 3087 states and 4224 transitions. [2022-07-12 11:23:58,860 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-12 11:23:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4224 transitions. [2022-07-12 11:23:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:23:58,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:58,862 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-12 11:23:58,882 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-12 11:23:59,078 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-12 11:23:59,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2022-07-12 11:23:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525960003] [2022-07-12 11:23:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:59,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:59,082 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-12 11:23:59,084 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-12 11:23:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:59,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:23:59,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:00,061 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-12 11:24:00,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:00,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525960003] [2022-07-12 11:24:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525960003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:00,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:00,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:24:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725679164] [2022-07-12 11:24:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:00,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:24:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:24:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:24:00,062 INFO L87 Difference]: Start difference. First operand 3087 states and 4224 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-12 11:24:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:00,305 INFO L93 Difference]: Finished difference Result 4754 states and 6535 transitions. [2022-07-12 11:24:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:24:00,306 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-12 11:24:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:00,314 INFO L225 Difference]: With dead ends: 4754 [2022-07-12 11:24:00,314 INFO L226 Difference]: Without dead ends: 3095 [2022-07-12 11:24:00,318 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-12 11:24:00,318 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 2 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:00,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:24:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-07-12 11:24:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3095. [2022-07-12 11:24:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 2248 states have (on average 1.2624555160142348) internal successors, (2838), 2247 states have internal predecessors, (2838), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 686 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-12 11:24:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 4232 transitions. [2022-07-12 11:24:00,431 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 4232 transitions. Word has length 87 [2022-07-12 11:24:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:00,432 INFO L495 AbstractCegarLoop]: Abstraction has 3095 states and 4232 transitions. [2022-07-12 11:24:00,432 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-12 11:24:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4232 transitions. [2022-07-12 11:24:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:24:00,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:00,434 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-12 11:24:00,453 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-12 11:24:00,647 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-12 11:24:00,648 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2022-07-12 11:24:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:00,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143221673] [2022-07-12 11:24:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:00,650 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-12 11:24:00,663 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-12 11:24:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:01,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:24:01,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:01,307 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-12 11:24:01,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:01,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:01,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143221673] [2022-07-12 11:24:01,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143221673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:01,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:01,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:24:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850896790] [2022-07-12 11:24:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:01,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:24:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:24:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:24:01,308 INFO L87 Difference]: Start difference. First operand 3095 states and 4232 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-12 11:24:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:01,645 INFO L93 Difference]: Finished difference Result 5757 states and 8092 transitions. [2022-07-12 11:24:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:24:01,646 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-12 11:24:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:01,655 INFO L225 Difference]: With dead ends: 5757 [2022-07-12 11:24:01,655 INFO L226 Difference]: Without dead ends: 4094 [2022-07-12 11:24:01,659 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-12 11:24:01,659 INFO L413 NwaCegarLoop]: 854 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, 1452 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-12 11:24:01,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1452 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:24:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2022-07-12 11:24:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 3103. [2022-07-12 11:24:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2256 states have (on average 1.2615248226950355) internal successors, (2846), 2255 states have internal predecessors, (2846), 650 states have call successors, (650), 177 states have call predecessors, (650), 196 states have return successors, (744), 686 states have call predecessors, (744), 646 states have call successors, (744) [2022-07-12 11:24:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4240 transitions. [2022-07-12 11:24:01,816 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4240 transitions. Word has length 87 [2022-07-12 11:24:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:01,817 INFO L495 AbstractCegarLoop]: Abstraction has 3103 states and 4240 transitions. [2022-07-12 11:24:01,817 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-12 11:24:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4240 transitions. [2022-07-12 11:24:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:24:01,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:01,819 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-12 11:24:01,853 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-12 11:24:02,035 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-12 11:24:02,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2022-07-12 11:24:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:02,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474567549] [2022-07-12 11:24:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:02,038 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-12 11:24:02,040 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-12 11:24:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:02,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:24:02,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:02,663 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-12 11:24:02,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:02,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:02,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474567549] [2022-07-12 11:24:02,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474567549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:02,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:02,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:24:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715153331] [2022-07-12 11:24:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:02,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:24:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:24:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:24:02,665 INFO L87 Difference]: Start difference. First operand 3103 states and 4240 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-12 11:24:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:02,916 INFO L93 Difference]: Finished difference Result 6256 states and 8535 transitions. [2022-07-12 11:24:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:24:02,916 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-12 11:24:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:02,924 INFO L225 Difference]: With dead ends: 6256 [2022-07-12 11:24:02,924 INFO L226 Difference]: Without dead ends: 3159 [2022-07-12 11:24:02,930 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-12 11:24:02,930 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-12 11:24:02,931 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-12 11:24:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2022-07-12 11:24:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 3121. [2022-07-12 11:24:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2268 states have (on average 1.259700176366843) internal successors, (2857), 2267 states have internal predecessors, (2857), 653 states have call successors, (653), 180 states have call predecessors, (653), 199 states have return successors, (747), 689 states have call predecessors, (747), 649 states have call successors, (747) [2022-07-12 11:24:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4257 transitions. [2022-07-12 11:24:03,088 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4257 transitions. Word has length 94 [2022-07-12 11:24:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:03,088 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4257 transitions. [2022-07-12 11:24:03,088 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-12 11:24:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4257 transitions. [2022-07-12 11:24:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:24:03,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:03,090 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-12 11:24:03,108 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-12 11:24:03,305 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-12 11:24:03,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash -153386871, now seen corresponding path program 1 times [2022-07-12 11:24:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:03,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907711455] [2022-07-12 11:24:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:03,308 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-12 11:24:03,309 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-12 11:24:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:03,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:24:03,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:04,353 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-12 11:24:04,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:04,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907711455] [2022-07-12 11:24:04,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907711455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:04,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:24:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158343785] [2022-07-12 11:24:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:04,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:24:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:24:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:24:04,354 INFO L87 Difference]: Start difference. First operand 3121 states and 4257 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-12 11:24:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:05,792 INFO L93 Difference]: Finished difference Result 8116 states and 11425 transitions. [2022-07-12 11:24:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:24:05,793 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-12 11:24:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:05,808 INFO L225 Difference]: With dead ends: 8116 [2022-07-12 11:24:05,808 INFO L226 Difference]: Without dead ends: 5007 [2022-07-12 11:24:05,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:24:05,838 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 228 mSDsluCounter, 6202 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 7019 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:05,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 7019 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 11:24:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2022-07-12 11:24:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 3121. [2022-07-12 11:24:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2268 states have (on average 1.2561728395061729) internal successors, (2849), 2267 states have internal predecessors, (2849), 653 states have call successors, (653), 180 states have call predecessors, (653), 199 states have return successors, (747), 689 states have call predecessors, (747), 649 states have call successors, (747) [2022-07-12 11:24:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4249 transitions. [2022-07-12 11:24:06,083 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4249 transitions. Word has length 96 [2022-07-12 11:24:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:06,083 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4249 transitions. [2022-07-12 11:24:06,083 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-12 11:24:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4249 transitions. [2022-07-12 11:24:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 11:24:06,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:06,085 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-12 11:24:06,104 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-12 11:24:06,302 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-12 11:24:06,302 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:06,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2022-07-12 11:24:06,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:06,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428233119] [2022-07-12 11:24:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:06,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:06,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:06,308 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-12 11:24:06,348 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-12 11:24:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:06,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:24:06,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:07,743 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-12 11:24:07,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:08,765 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-12 11:24:08,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428233119] [2022-07-12 11:24:08,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428233119] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:24:08,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:24:08,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-12 11:24:08,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077995885] [2022-07-12 11:24:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:24:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:24:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:24:08,767 INFO L87 Difference]: Start difference. First operand 3121 states and 4249 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-12 11:24:11,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:14,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:17,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:21,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:23,328 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-12 11:24:25,363 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-12 11:24:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:28,393 INFO L93 Difference]: Finished difference Result 6331 states and 8645 transitions. [2022-07-12 11:24:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:24:28,394 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-12 11:24:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:28,407 INFO L225 Difference]: With dead ends: 6331 [2022-07-12 11:24:28,407 INFO L226 Difference]: Without dead ends: 6328 [2022-07-12 11:24:28,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:24:28,409 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 1516 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 401 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:28,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 1729 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1024 Invalid, 5 Unknown, 0 Unchecked, 19.1s Time] [2022-07-12 11:24:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2022-07-12 11:24:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6217. [2022-07-12 11:24:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6217 states, 4512 states have (on average 1.2595301418439717) internal successors, (5683), 4501 states have internal predecessors, (5683), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 393 states have return successors, (1529), 1397 states have call predecessors, (1529), 1307 states have call successors, (1529) [2022-07-12 11:24:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 8523 transitions. [2022-07-12 11:24:28,721 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 8523 transitions. Word has length 89 [2022-07-12 11:24:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:28,721 INFO L495 AbstractCegarLoop]: Abstraction has 6217 states and 8523 transitions. [2022-07-12 11:24:28,721 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-12 11:24:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 8523 transitions. [2022-07-12 11:24:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:24:28,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:28,724 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-12 11:24:28,758 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-12 11:24:28,942 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-12 11:24:28,943 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2022-07-12 11:24:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:28,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521372240] [2022-07-12 11:24:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:28,945 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-12 11:24:28,949 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-12 11:24:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:29,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 11:24:29,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:30,243 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-12 11:24:30,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:31,170 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-12 11:24:31,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521372240] [2022-07-12 11:24:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521372240] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:24:31,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:24:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-12 11:24:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433132224] [2022-07-12 11:24:31,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:24:31,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:24:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:31,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:24:31,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:24:31,172 INFO L87 Difference]: Start difference. First operand 6217 states and 8523 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-12 11:24:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:33,442 INFO L93 Difference]: Finished difference Result 15734 states and 22331 transitions. [2022-07-12 11:24:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:24:33,443 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-12 11:24:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:33,532 INFO L225 Difference]: With dead ends: 15734 [2022-07-12 11:24:33,532 INFO L226 Difference]: Without dead ends: 9529 [2022-07-12 11:24:33,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:24:33,575 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 221 mSDsluCounter, 7794 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 8615 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:33,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 8615 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 11:24:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9529 states. [2022-07-12 11:24:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9529 to 6219. [2022-07-12 11:24:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6219 states, 4510 states have (on average 1.2596452328159646) internal successors, (5681), 4509 states have internal predecessors, (5681), 1311 states have call successors, (1311), 354 states have call predecessors, (1311), 397 states have return successors, (1539), 1383 states have call predecessors, (1539), 1307 states have call successors, (1539) [2022-07-12 11:24:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 8531 transitions. [2022-07-12 11:24:34,092 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 8531 transitions. Word has length 94 [2022-07-12 11:24:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:34,093 INFO L495 AbstractCegarLoop]: Abstraction has 6219 states and 8531 transitions. [2022-07-12 11:24:34,093 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-12 11:24:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 8531 transitions. [2022-07-12 11:24:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 11:24:34,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:34,095 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-12 11:24:34,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:34,311 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-12 11:24:34,312 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2022-07-12 11:24:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:34,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84548697] [2022-07-12 11:24:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:34,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:34,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:34,315 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-12 11:24:34,317 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-12 11:24:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:34,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:24:34,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:35,363 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-12 11:24:35,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:35,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:35,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84548697] [2022-07-12 11:24:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84548697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:35,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:35,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:24:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926518084] [2022-07-12 11:24:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:35,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:24:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:24:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:24:35,365 INFO L87 Difference]: Start difference. First operand 6219 states and 8531 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-12 11:24:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:36,763 INFO L93 Difference]: Finished difference Result 14892 states and 21021 transitions. [2022-07-12 11:24:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:24:36,764 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-12 11:24:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:36,817 INFO L225 Difference]: With dead ends: 14892 [2022-07-12 11:24:36,824 INFO L226 Difference]: Without dead ends: 8685 [2022-07-12 11:24:36,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:24:36,835 INFO L413 NwaCegarLoop]: 834 mSDtfsCounter, 213 mSDsluCounter, 6334 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 7168 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:36,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 7168 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:24:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2022-07-12 11:24:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 6211. [2022-07-12 11:24:37,248 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-12 11:24:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8507 transitions. [2022-07-12 11:24:37,272 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8507 transitions. Word has length 97 [2022-07-12 11:24:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:37,272 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 8507 transitions. [2022-07-12 11:24:37,273 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-12 11:24:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8507 transitions. [2022-07-12 11:24:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:24:37,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:37,294 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-12 11:24:37,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-12 11:24:37,507 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-12 11:24:37,507 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2022-07-12 11:24:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:37,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483479798] [2022-07-12 11:24:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:37,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:37,510 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-12 11:24:37,512 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-12 11:24:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:38,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:24:38,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:38,403 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-12 11:24:38,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:38,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483479798] [2022-07-12 11:24:38,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483479798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:38,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:38,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:24:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179541048] [2022-07-12 11:24:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:24:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:38,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:24:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:24:38,405 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-12 11:24:40,585 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-12 11:24:42,868 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-12 11:24:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:43,060 INFO L93 Difference]: Finished difference Result 12479 states and 17093 transitions. [2022-07-12 11:24:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:24:43,061 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-12 11:24:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:43,093 INFO L225 Difference]: With dead ends: 12479 [2022-07-12 11:24:43,107 INFO L226 Difference]: Without dead ends: 6277 [2022-07-12 11:24:43,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:24:43,121 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 20 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2754 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-12 11:24:43,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2754 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 11:24:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2022-07-12 11:24:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 6220. [2022-07-12 11:24:43,426 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-12 11:24:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 8515 transitions. [2022-07-12 11:24:43,442 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 8515 transitions. Word has length 108 [2022-07-12 11:24:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:43,443 INFO L495 AbstractCegarLoop]: Abstraction has 6220 states and 8515 transitions. [2022-07-12 11:24:43,443 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-12 11:24:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 8515 transitions. [2022-07-12 11:24:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:24:43,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:43,446 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-12 11:24:43,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-12 11:24:43,659 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-12 11:24:43,660 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1967666458, now seen corresponding path program 1 times [2022-07-12 11:24:43,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246312672] [2022-07-12 11:24:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:43,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:43,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:43,662 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-12 11:24:43,664 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-12 11:24:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:44,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:24:44,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:44,415 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-12 11:24:44,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:44,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:44,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246312672] [2022-07-12 11:24:44,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246312672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:44,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:44,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:24:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079603549] [2022-07-12 11:24:44,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:44,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:24:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:24:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:24:44,416 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-12 11:24:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:44,781 INFO L93 Difference]: Finished difference Result 12464 states and 17066 transitions. [2022-07-12 11:24:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:24:44,781 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-12 11:24:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:44,799 INFO L225 Difference]: With dead ends: 12464 [2022-07-12 11:24:44,800 INFO L226 Difference]: Without dead ends: 6256 [2022-07-12 11:24:44,812 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-12 11:24:44,813 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-12 11:24:44,813 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-12 11:24:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2022-07-12 11:24:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6244. [2022-07-12 11:24:45,171 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-12 11:24:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6244 states to 6244 states and 8539 transitions. [2022-07-12 11:24:45,191 INFO L78 Accepts]: Start accepts. Automaton has 6244 states and 8539 transitions. Word has length 108 [2022-07-12 11:24:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:45,191 INFO L495 AbstractCegarLoop]: Abstraction has 6244 states and 8539 transitions. [2022-07-12 11:24:45,192 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-12 11:24:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6244 states and 8539 transitions. [2022-07-12 11:24:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 11:24:45,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:45,194 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-12 11:24:45,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-12 11:24:45,407 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-12 11:24:45,407 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2022-07-12 11:24:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:45,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486445354] [2022-07-12 11:24:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:45,410 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-12 11:24:45,412 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-12 11:24:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:46,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:24:46,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:47,021 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-12 11:24:47,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:47,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:47,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486445354] [2022-07-12 11:24:47,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486445354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:47,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:47,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:24:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249769365] [2022-07-12 11:24:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:24:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:24:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:24:47,023 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-12 11:24:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:49,088 INFO L93 Difference]: Finished difference Result 13485 states and 19006 transitions. [2022-07-12 11:24:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:24:49,089 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-12 11:24:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:49,104 INFO L225 Difference]: With dead ends: 13485 [2022-07-12 11:24:49,104 INFO L226 Difference]: Without dead ends: 8677 [2022-07-12 11:24:49,113 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-12 11:24:49,113 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 209 mSDsluCounter, 7908 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 8734 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:49,114 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.5s Time] [2022-07-12 11:24:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2022-07-12 11:24:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6188. [2022-07-12 11:24:49,443 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-12 11:24:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8441 transitions. [2022-07-12 11:24:49,459 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8441 transitions. Word has length 104 [2022-07-12 11:24:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:49,459 INFO L495 AbstractCegarLoop]: Abstraction has 6188 states and 8441 transitions. [2022-07-12 11:24:49,459 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-12 11:24:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8441 transitions. [2022-07-12 11:24:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 11:24:49,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:49,461 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-12 11:24:49,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:49,677 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-12 11:24:49,677 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1396982830, now seen corresponding path program 1 times [2022-07-12 11:24:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:49,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115670900] [2022-07-12 11:24:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:49,680 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-12 11:24:49,681 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-12 11:24:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:24:50,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:50,472 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-12 11:24:50,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:50,622 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-12 11:24:50,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:50,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115670900] [2022-07-12 11:24:50,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115670900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:24:50,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:24:50,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 11:24:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788931023] [2022-07-12 11:24:50,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:24:50,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:24:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:24:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:24:50,623 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-12 11:24:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:51,194 INFO L93 Difference]: Finished difference Result 12472 states and 17014 transitions. [2022-07-12 11:24:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:24:51,195 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-12 11:24:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:51,210 INFO L225 Difference]: With dead ends: 12472 [2022-07-12 11:24:51,210 INFO L226 Difference]: Without dead ends: 6296 [2022-07-12 11:24:51,220 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-12 11:24:51,227 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 5 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:51,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1629 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:24:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2022-07-12 11:24:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 6296. [2022-07-12 11:24:51,698 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-12 11:24:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6296 states to 6296 states and 8549 transitions. [2022-07-12 11:24:51,716 INFO L78 Accepts]: Start accepts. Automaton has 6296 states and 8549 transitions. Word has length 111 [2022-07-12 11:24:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:51,716 INFO L495 AbstractCegarLoop]: Abstraction has 6296 states and 8549 transitions. [2022-07-12 11:24:51,717 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-12 11:24:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6296 states and 8549 transitions. [2022-07-12 11:24:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 11:24:51,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:51,741 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:24:51,763 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-12 11:24:51,941 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-12 11:24:51,942 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -756764579, now seen corresponding path program 1 times [2022-07-12 11:24:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:51,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305826559] [2022-07-12 11:24:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:51,944 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-12 11:24:51,946 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-12 11:24:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:24:52,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:53,240 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-12 11:24:53,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:53,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305826559] [2022-07-12 11:24:53,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305826559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:53,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:53,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:24:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362100559] [2022-07-12 11:24:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:24:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:24:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:24:53,242 INFO L87 Difference]: Start difference. First operand 6296 states and 8549 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:24:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:55,139 INFO L93 Difference]: Finished difference Result 14191 states and 19830 transitions. [2022-07-12 11:24:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:24:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2022-07-12 11:24:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:55,169 INFO L225 Difference]: With dead ends: 14191 [2022-07-12 11:24:55,169 INFO L226 Difference]: Without dead ends: 9358 [2022-07-12 11:24:55,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:24:55,179 INFO L413 NwaCegarLoop]: 891 mSDtfsCounter, 224 mSDsluCounter, 6804 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 7695 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:55,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 7695 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 11:24:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2022-07-12 11:24:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 6312. [2022-07-12 11:24:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6312 states, 4629 states have (on average 1.2477856988550442) internal successors, (5776), 4631 states have internal predecessors, (5776), 1287 states have call successors, (1287), 350 states have call predecessors, (1287), 395 states have return successors, (1502), 1358 states have call predecessors, (1502), 1283 states have call successors, (1502) [2022-07-12 11:24:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 8565 transitions. [2022-07-12 11:24:55,717 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 8565 transitions. Word has length 122 [2022-07-12 11:24:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 6312 states and 8565 transitions. [2022-07-12 11:24:55,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:24:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 8565 transitions. [2022-07-12 11:24:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:24:55,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:55,721 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-12 11:24:55,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:55,936 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-12 11:24:55,936 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash -645931029, now seen corresponding path program 1 times [2022-07-12 11:24:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:55,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291831859] [2022-07-12 11:24:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:55,938 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-12 11:24:55,941 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-12 11:24:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:56,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:24:56,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:57,012 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-12 11:24:57,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:57,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:57,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291831859] [2022-07-12 11:24:57,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291831859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:57,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:57,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:24:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945221146] [2022-07-12 11:24:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:57,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:24:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:24:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:24:57,014 INFO L87 Difference]: Start difference. First operand 6312 states and 8565 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-12 11:24:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:58,612 INFO L93 Difference]: Finished difference Result 15444 states and 21440 transitions. [2022-07-12 11:24:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:24:58,614 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-12 11:24:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:58,633 INFO L225 Difference]: With dead ends: 15444 [2022-07-12 11:24:58,634 INFO L226 Difference]: Without dead ends: 9144 [2022-07-12 11:24:58,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:24:58,643 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 177 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 3039 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:24:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9144 states. [2022-07-12 11:24:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9144 to 6115. [2022-07-12 11:24:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 4512 states have (on average 1.2462322695035462) internal successors, (5623), 4514 states have internal predecessors, (5623), 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-12 11:24:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 8272 transitions. [2022-07-12 11:24:59,149 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 8272 transitions. Word has length 124 [2022-07-12 11:24:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:59,150 INFO L495 AbstractCegarLoop]: Abstraction has 6115 states and 8272 transitions. [2022-07-12 11:24:59,150 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-12 11:24:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 8272 transitions. [2022-07-12 11:24:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 11:24:59,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:59,159 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-12 11:24:59,185 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-12 11:24:59,382 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-12 11:24:59,382 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash -61836419, now seen corresponding path program 1 times [2022-07-12 11:24:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:59,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989502138] [2022-07-12 11:24:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:59,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:59,386 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-12 11:24:59,387 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-12 11:25:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:25:00,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 11:25:00,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:25:00,971 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-12 11:25:00,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:25:02,034 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-12 11:25:02,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:25:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989502138] [2022-07-12 11:25:02,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989502138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:25:02,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:25:02,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2022-07-12 11:25:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030534438] [2022-07-12 11:25:02,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:25:02,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:25:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:25:02,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:25:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:25:02,036 INFO L87 Difference]: Start difference. First operand 6115 states and 8272 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-12 11:25:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:25:05,338 INFO L93 Difference]: Finished difference Result 15747 states and 21931 transitions. [2022-07-12 11:25:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:25:05,341 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-12 11:25:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:25:05,365 INFO L225 Difference]: With dead ends: 15747 [2022-07-12 11:25:05,366 INFO L226 Difference]: Without dead ends: 9644 [2022-07-12 11:25:05,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 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-12 11:25:05,378 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 239 mSDsluCounter, 7477 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 8259 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:25:05,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 8259 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 11:25:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2022-07-12 11:25:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 6103. [2022-07-12 11:25:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4500 states have (on average 1.246888888888889) internal successors, (5611), 4514 states have internal predecessors, (5611), 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-12 11:25:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 8236 transitions. [2022-07-12 11:25:05,796 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 8236 transitions. Word has length 122 [2022-07-12 11:25:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:25:05,796 INFO L495 AbstractCegarLoop]: Abstraction has 6103 states and 8236 transitions. [2022-07-12 11:25:05,796 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-12 11:25:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 8236 transitions. [2022-07-12 11:25:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:25:05,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:25:05,798 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-12 11:25:05,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 11:25:06,011 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-12 11:25:06,011 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:25:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:25:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1117139730, now seen corresponding path program 1 times [2022-07-12 11:25:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:25:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843290787] [2022-07-12 11:25:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:25:06,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:25:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:25:06,014 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-12 11:25:06,015 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-12 11:25:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:25:13,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 11:25:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:25:19,975 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 11:25:19,976 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 11:25:19,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:25:20,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 11:25:20,197 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-12 11:25:20,199 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, 1, 1, 1] [2022-07-12 11:25:20,201 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:25:20,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:25:20 BoogieIcfgContainer [2022-07-12 11:25:20,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:25:20,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:25:20,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:25:20,351 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:25:20,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:23:09" (3/4) ... [2022-07-12 11:25:20,353 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 11:25:20,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:25:20,354 INFO L158 Benchmark]: Toolchain (without parser) took 144329.52ms. Allocated memory was 67.1MB in the beginning and 989.9MB in the end (delta: 922.7MB). Free memory was 41.4MB in the beginning and 508.5MB in the end (delta: -467.1MB). Peak memory consumption was 455.9MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,355 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:25:20,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1442.05ms. Allocated memory was 67.1MB in the beginning and 148.9MB in the end (delta: 81.8MB). Free memory was 41.2MB in the beginning and 78.0MB in the end (delta: -36.9MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.08ms. Allocated memory is still 148.9MB. Free memory was 78.0MB in the beginning and 68.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,359 INFO L158 Benchmark]: Boogie Preprocessor took 132.20ms. Allocated memory is still 148.9MB. Free memory was 68.9MB in the beginning and 91.6MB in the end (delta: -22.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,360 INFO L158 Benchmark]: RCFGBuilder took 12077.22ms. Allocated memory was 148.9MB in the beginning and 272.6MB in the end (delta: 123.7MB). Free memory was 91.6MB in the beginning and 197.0MB in the end (delta: -105.4MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,363 INFO L158 Benchmark]: TraceAbstraction took 130542.00ms. Allocated memory was 272.6MB in the beginning and 989.9MB in the end (delta: 717.2MB). Free memory was 195.9MB in the beginning and 509.6MB in the end (delta: -313.6MB). Peak memory consumption was 403.6MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,364 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 989.9MB. Free memory was 509.6MB in the beginning and 508.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 11:25:20,365 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.22ms. Allocated memory is still 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1442.05ms. Allocated memory was 67.1MB in the beginning and 148.9MB in the end (delta: 81.8MB). Free memory was 41.2MB in the beginning and 78.0MB in the end (delta: -36.9MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.08ms. Allocated memory is still 148.9MB. Free memory was 78.0MB in the beginning and 68.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.20ms. Allocated memory is still 148.9MB. Free memory was 68.9MB in the beginning and 91.6MB in the end (delta: -22.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * RCFGBuilder took 12077.22ms. Allocated memory was 148.9MB in the beginning and 272.6MB in the end (delta: 123.7MB). Free memory was 91.6MB in the beginning and 197.0MB in the end (delta: -105.4MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. * TraceAbstraction took 130542.00ms. Allocated memory was 272.6MB in the beginning and 989.9MB in the end (delta: 717.2MB). Free memory was 195.9MB in the beginning and 509.6MB in the end (delta: -313.6MB). Peak memory consumption was 403.6MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 989.9MB. Free memory was 509.6MB in the beginning and 508.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5143. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 [L6631] FCALL ldv_initialize() [L6632] CALL, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L6569] CALL, EXPR usb_register(& ems_usb_driver) [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] RET, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, driver={41:0}, driver={41:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6569] RET, EXPR usb_register(& ems_usb_driver) [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [\result=0, __key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, err=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] RET, EXPR ems_usb_init() VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_init()=0, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6641] COND TRUE 1 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___9=2147483648] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=2147483648] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=2147483648] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=2147483648] [L6704] CALL ems_usb_start_xmit(var_group2, var_group1) [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; VAL [__key___7={36:0}, __key___8={37:0}, __this_module={70:71}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={0:1}, skb={0:1}] [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:1}, skb={0:1}] [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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}] [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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, context={0:0}, dev={0:-520}, dev->udev={0:144115188075855872}, ems_usb_bittiming_const={40:0}, ems_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:1}, skb={0:1}, 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:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:4398046511104}, context={0:0}, dev={0:-520}, dev->udev={0:144115188075855872}, ems_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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, cf->can_id=-1073676288, 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:1}, skb={0:1}, 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:4398046511104}, cf->can_id=-1073676288, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:4398046511104}, context={0:0}, dev={0:-520}, dev->udev={0:144115188075855872}, 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:1}, skb={0:1}, 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:144115188075855872}, ems_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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:144115188075855872}, dev={0:144115188075855872}, 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:4398046511104}, context={0:0}, dev={0:-520}, dev->udev={0:144115188075855872}, 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:1}, skb={0:1}, 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:4398046511104}, 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:1}, skb={0:1}, 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:1}] [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:1}] [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:1}] [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:1}] [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:1}] [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: 130.3s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 74.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 8265 SdHoareTripleChecker+Valid, 65.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7199 mSDsluCounter, 99592 SdHoareTripleChecker+Invalid, 62.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79090 mSDsCounter, 1008 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4455 IncrementalHoareTripleChecker+Invalid, 5476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1008 mSolverCounterUnsat, 20502 mSDtfsCounter, 4455 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2923 GetRequests, 2773 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6312occurred in iteration=26, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 30029 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 14.6s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2523 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2895 ConstructedInterpolants, 0 QuantifiedInterpolants, 4332 SizeOfPredicates, 46 NumberOfNonLiveVariables, 22891 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 300/334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 11:25:20,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample