./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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-input-tablet-kbtab.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 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:24:36,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:24:36,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:24:36,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:24:36,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:24:36,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:24:36,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:24:36,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:24:36,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:24:36,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:24:36,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:24:36,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:24:36,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:24:36,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:24:36,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:24:36,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:24:36,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:24:36,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:24:36,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:24:36,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:24:36,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:24:36,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:24:36,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:24:36,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:24:36,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:24:36,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:24:36,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:24:36,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:24:36,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:24:36,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:24:36,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:24:36,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:24:36,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:24:36,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:24:36,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:24:36,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:24:36,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:24:36,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:24:36,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:24:36,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:24:36,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:24:36,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:24:36,580 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:24:36,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:24:36,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:24:36,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:24:36,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:24:36,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:24:36,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:24:36,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:24:36,584 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:24:36,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:24:36,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:24:36,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:24:36,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:24:36,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:24:36,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:24:36,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:24:36,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:24:36,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:24:36,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:24:36,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:24:36,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:24:36,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:24:36,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:24:36,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:24:36,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:24:36,588 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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2021-12-28 03:24:36,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:24:36,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:24:36,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:24:36,868 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:24:36,869 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:24:36,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-28 03:24:36,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76e66b81/bcb159d7877c41a099f0ab66aff93162/FLAG84f3878a4 [2021-12-28 03:24:37,425 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:24:37,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-28 03:24:37,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76e66b81/bcb159d7877c41a099f0ab66aff93162/FLAG84f3878a4 [2021-12-28 03:24:37,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76e66b81/bcb159d7877c41a099f0ab66aff93162 [2021-12-28 03:24:37,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:24:37,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:24:37,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:24:37,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:24:37,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:24:37,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:24:37" (1/1) ... [2021-12-28 03:24:37,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fad0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:37, skipping insertion in model container [2021-12-28 03:24:37,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:24:37" (1/1) ... [2021-12-28 03:24:37,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:24:37,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:24:38,280 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-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-12-28 03:24:38,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:24:38,335 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:24:38,458 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-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-12-28 03:24:38,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:24:38,493 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:24:38,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38 WrapperNode [2021-12-28 03:24:38,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:24:38,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:24:38,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:24:38,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:24:38,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,582 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2021-12-28 03:24:38,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:24:38,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:24:38,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:24:38,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:24:38,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:24:38,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:24:38,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:24:38,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:24:38,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (1/1) ... [2021-12-28 03:24:38,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:24:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:38,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 03:24:38,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 03:24:38,734 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2021-12-28 03:24:38,735 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2021-12-28 03:24:38,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:24:38,736 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-12-28 03:24:38,736 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-12-28 03:24:38,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:24:38,736 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-12-28 03:24:38,736 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-12-28 03:24:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2021-12-28 03:24:38,737 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2021-12-28 03:24:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-28 03:24:38,737 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-28 03:24:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:24:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 03:24:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-28 03:24:38,738 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-28 03:24:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 03:24:38,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 03:24:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-28 03:24:38,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-28 03:24:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:24:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-12-28 03:24:38,739 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-12-28 03:24:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:24:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 03:24:38,739 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 03:24:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:24:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-28 03:24:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-28 03:24:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-28 03:24:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-28 03:24:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-28 03:24:38,741 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-28 03:24:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-28 03:24:38,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-28 03:24:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:24:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:24:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:24:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:24:38,964 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:24:38,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:24:39,099 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-28 03:24:39,110 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-28 03:24:39,531 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-28 03:24:39,531 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-28 03:24:39,542 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:24:39,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:24:39,550 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-28 03:24:39,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:24:39 BoogieIcfgContainer [2021-12-28 03:24:39,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:24:39,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:24:39,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:24:39,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:24:39,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:24:37" (1/3) ... [2021-12-28 03:24:39,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5309ff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:24:39, skipping insertion in model container [2021-12-28 03:24:39,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:38" (2/3) ... [2021-12-28 03:24:39,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5309ff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:24:39, skipping insertion in model container [2021-12-28 03:24:39,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:24:39" (3/3) ... [2021-12-28 03:24:39,558 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-28 03:24:39,563 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:24:39,563 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:24:39,597 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:24:39,602 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:24:39,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:24:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-12-28 03:24:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 03:24:39,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:39,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:39,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2021-12-28 03:24:39,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730921863] [2021-12-28 03:24:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:39,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:40,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:40,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730921863] [2021-12-28 03:24:40,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730921863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:40,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:40,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:24:40,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607371481] [2021-12-28 03:24:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:40,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:24:40,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:24:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:40,071 INFO L87 Difference]: Start difference. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:40,147 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2021-12-28 03:24:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:24:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-28 03:24:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:40,160 INFO L225 Difference]: With dead ends: 447 [2021-12-28 03:24:40,163 INFO L226 Difference]: Without dead ends: 287 [2021-12-28 03:24:40,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:40,172 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 184 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:40,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 408 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-28 03:24:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2021-12-28 03:24:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 210 states have (on average 1.2190476190476192) internal successors, (256), 214 states have internal predecessors, (256), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2021-12-28 03:24:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2021-12-28 03:24:40,254 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2021-12-28 03:24:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:40,255 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2021-12-28 03:24:40,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2021-12-28 03:24:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 03:24:40,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:40,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:40,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:24:40,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2021-12-28 03:24:40,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:40,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866925338] [2021-12-28 03:24:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:40,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:40,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:40,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866925338] [2021-12-28 03:24:40,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866925338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:40,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:40,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:24:40,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997029953] [2021-12-28 03:24:40,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:40,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:24:40,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:24:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:40,383 INFO L87 Difference]: Start difference. First operand 283 states and 350 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:40,426 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2021-12-28 03:24:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:24:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2021-12-28 03:24:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:40,433 INFO L225 Difference]: With dead ends: 820 [2021-12-28 03:24:40,433 INFO L226 Difference]: Without dead ends: 542 [2021-12-28 03:24:40,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:40,437 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:40,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 417 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-12-28 03:24:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2021-12-28 03:24:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2110552763819096) internal successors, (482), 401 states have internal predecessors, (482), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2021-12-28 03:24:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2021-12-28 03:24:40,462 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2021-12-28 03:24:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:40,463 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2021-12-28 03:24:40,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2021-12-28 03:24:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 03:24:40,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:40,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:40,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:24:40,465 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2021-12-28 03:24:40,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:40,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83306900] [2021-12-28 03:24:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:40,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 03:24:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:40,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:40,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83306900] [2021-12-28 03:24:40,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83306900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:40,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:40,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 03:24:40,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451511882] [2021-12-28 03:24:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:40,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:24:40,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:24:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:24:40,637 INFO L87 Difference]: Start difference. First operand 535 states and 662 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 03:24:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:40,844 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2021-12-28 03:24:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:24:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-28 03:24:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:40,848 INFO L225 Difference]: With dead ends: 1114 [2021-12-28 03:24:40,848 INFO L226 Difference]: Without dead ends: 587 [2021-12-28 03:24:40,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:24:40,850 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 53 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:40,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 780 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:24:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-12-28 03:24:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2021-12-28 03:24:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2085427135678393) internal successors, (481), 401 states have internal predecessors, (481), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2021-12-28 03:24:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2021-12-28 03:24:40,866 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2021-12-28 03:24:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:40,867 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2021-12-28 03:24:40,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 03:24:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2021-12-28 03:24:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 03:24:40,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:40,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:40,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:24:40,869 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2021-12-28 03:24:40,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:40,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345124296] [2021-12-28 03:24:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:40,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 03:24:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:41,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345124296] [2021-12-28 03:24:41,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345124296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:41,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:41,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:24:41,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460926180] [2021-12-28 03:24:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:41,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:24:41,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:24:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:24:41,003 INFO L87 Difference]: Start difference. First operand 535 states and 661 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 03:24:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:41,248 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2021-12-28 03:24:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:24:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-28 03:24:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:41,251 INFO L225 Difference]: With dead ends: 1233 [2021-12-28 03:24:41,251 INFO L226 Difference]: Without dead ends: 709 [2021-12-28 03:24:41,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:24:41,253 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 206 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:41,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 472 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:24:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-28 03:24:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2021-12-28 03:24:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 469 states have (on average 1.2409381663113006) internal successors, (582), 472 states have internal predecessors, (582), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2021-12-28 03:24:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2021-12-28 03:24:41,300 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2021-12-28 03:24:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:41,301 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2021-12-28 03:24:41,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 03:24:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2021-12-28 03:24:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-28 03:24:41,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:41,306 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-28 03:24:41,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:24:41,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2021-12-28 03:24:41,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:41,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871397979] [2021-12-28 03:24:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:41,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:41,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871397979] [2021-12-28 03:24:41,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871397979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437267832] [2021-12-28 03:24:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:41,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:41,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:41,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:24:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:41,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 03:24:41,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:24:42,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:42,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437267832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:42,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:42,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-28 03:24:42,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003941423] [2021-12-28 03:24:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:42,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:42,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:42,108 INFO L87 Difference]: Start difference. First operand 606 states and 762 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:42,156 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2021-12-28 03:24:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 86 [2021-12-28 03:24:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:42,160 INFO L225 Difference]: With dead ends: 1189 [2021-12-28 03:24:42,160 INFO L226 Difference]: Without dead ends: 596 [2021-12-28 03:24:42,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:24:42,164 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:42,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-28 03:24:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-28 03:24:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 334 states have internal predecessors, (408), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2021-12-28 03:24:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2021-12-28 03:24:42,187 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2021-12-28 03:24:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:42,187 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2021-12-28 03:24:42,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2021-12-28 03:24:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 03:24:42,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:42,190 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-28 03:24:42,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:42,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:42,405 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2021-12-28 03:24:42,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:42,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618537096] [2021-12-28 03:24:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:42,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:24:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 03:24:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 03:24:42,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:42,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618537096] [2021-12-28 03:24:42,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618537096] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:42,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487281605] [2021-12-28 03:24:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:42,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:42,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:42,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 03:24:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:42,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 03:24:42,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 03:24:43,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:43,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487281605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:43,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:43,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-12-28 03:24:43,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079743431] [2021-12-28 03:24:43,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:43,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:43,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:24:43,100 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:43,227 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2021-12-28 03:24:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:24:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2021-12-28 03:24:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:43,230 INFO L225 Difference]: With dead ends: 906 [2021-12-28 03:24:43,230 INFO L226 Difference]: Without dead ends: 596 [2021-12-28 03:24:43,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:24:43,232 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:43,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1776 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:24:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-28 03:24:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-28 03:24:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 334 states have internal predecessors, (406), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2021-12-28 03:24:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2021-12-28 03:24:43,262 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2021-12-28 03:24:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:43,265 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2021-12-28 03:24:43,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2021-12-28 03:24:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-28 03:24:43,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:43,267 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-28 03:24:43,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:43,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 03:24:43,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2021-12-28 03:24:43,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728911682] [2021-12-28 03:24:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:43,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:43,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728911682] [2021-12-28 03:24:43,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728911682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713735512] [2021-12-28 03:24:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:43,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:43,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:43,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 03:24:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:43,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 03:24:43,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:24:44,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:44,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713735512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:44,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:44,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-28 03:24:44,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323997908] [2021-12-28 03:24:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:44,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:44,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:44,133 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:44,249 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2021-12-28 03:24:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 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 86 [2021-12-28 03:24:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:44,252 INFO L225 Difference]: With dead ends: 661 [2021-12-28 03:24:44,252 INFO L226 Difference]: Without dead ends: 658 [2021-12-28 03:24:44,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:44,253 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 284 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:44,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:24:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-12-28 03:24:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2021-12-28 03:24:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 497 states have (on average 1.2374245472837022) internal successors, (615), 498 states have internal predecessors, (615), 88 states have call successors, (88), 51 states have call predecessors, (88), 50 states have return successors, (88), 86 states have call predecessors, (88), 84 states have call successors, (88) [2021-12-28 03:24:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2021-12-28 03:24:44,274 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2021-12-28 03:24:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:44,275 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2021-12-28 03:24:44,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2021-12-28 03:24:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-28 03:24:44,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:44,276 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-28 03:24:44,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:44,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:44,490 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:44,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2021-12-28 03:24:44,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:44,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162445037] [2021-12-28 03:24:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:44,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:24:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 03:24:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:24:44,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:44,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162445037] [2021-12-28 03:24:44,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162445037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:44,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:44,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 03:24:44,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085930769] [2021-12-28 03:24:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:44,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:24:44,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:24:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:24:44,625 INFO L87 Difference]: Start difference. First operand 636 states and 791 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 03:24:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:44,846 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2021-12-28 03:24:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:24:44,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2021-12-28 03:24:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:44,849 INFO L225 Difference]: With dead ends: 1320 [2021-12-28 03:24:44,849 INFO L226 Difference]: Without dead ends: 685 [2021-12-28 03:24:44,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:24:44,851 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 163 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:44,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 604 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:24:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-12-28 03:24:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2021-12-28 03:24:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 465 states have (on average 1.2236559139784946) internal successors, (569), 466 states have internal predecessors, (569), 86 states have call successors, (86), 45 states have call predecessors, (86), 44 states have return successors, (88), 84 states have call predecessors, (88), 82 states have call successors, (88) [2021-12-28 03:24:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2021-12-28 03:24:44,875 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2021-12-28 03:24:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:44,876 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2021-12-28 03:24:44,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 03:24:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2021-12-28 03:24:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 03:24:44,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:44,877 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-28 03:24:44,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:24:44,877 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2021-12-28 03:24:44,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:44,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043330606] [2021-12-28 03:24:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:44,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:24:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:45,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043330606] [2021-12-28 03:24:45,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043330606] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778329578] [2021-12-28 03:24:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:45,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:45,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:45,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 03:24:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:45,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 03:24:45,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:46,071 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2021-12-28 03:24:46,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:24:46,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-28 03:24:46,212 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 03:24:46,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-28 03:24:46,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-28 03:24:46,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-28 03:24:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:24:46,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:46,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778329578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:46,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:46,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-12-28 03:24:46,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345854392] [2021-12-28 03:24:46,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:46,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:24:46,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:46,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:24:46,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2021-12-28 03:24:46,334 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:24:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:46,783 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2021-12-28 03:24:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:24:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105 [2021-12-28 03:24:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:46,786 INFO L225 Difference]: With dead ends: 702 [2021-12-28 03:24:46,786 INFO L226 Difference]: Without dead ends: 661 [2021-12-28 03:24:46,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2021-12-28 03:24:46,787 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:46,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1066 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 238 Unchecked, 0.4s Time] [2021-12-28 03:24:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-12-28 03:24:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-12-28 03:24:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 487 states have (on average 1.2258726899383983) internal successors, (597), 490 states have internal predecessors, (597), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (98), 88 states have call predecessors, (98), 86 states have call successors, (98) [2021-12-28 03:24:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2021-12-28 03:24:46,813 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2021-12-28 03:24:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:46,814 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2021-12-28 03:24:46,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:24:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2021-12-28 03:24:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 03:24:46,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:46,815 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-12-28 03:24:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:47,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:47,032 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2021-12-28 03:24:47,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:47,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818075272] [2021-12-28 03:24:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:47,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:24:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:47,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:47,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818075272] [2021-12-28 03:24:47,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818075272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:47,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481891905] [2021-12-28 03:24:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:47,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:47,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:47,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 03:24:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:47,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 03:24:47,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 03:24:47,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:47,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481891905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:47,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:47,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-28 03:24:47,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129483220] [2021-12-28 03:24:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:47,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:47,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:24:47,804 INFO L87 Difference]: Start difference. First operand 628 states and 785 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:47,916 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2021-12-28 03:24:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:24:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2021-12-28 03:24:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:47,920 INFO L225 Difference]: With dead ends: 1390 [2021-12-28 03:24:47,920 INFO L226 Difference]: Without dead ends: 810 [2021-12-28 03:24:47,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:24:47,922 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:47,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 2164 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:24:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-12-28 03:24:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2021-12-28 03:24:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 491 states have internal predecessors, (591), 88 states have call successors, (88), 49 states have call predecessors, (88), 54 states have return successors, (102), 87 states have call predecessors, (102), 84 states have call successors, (102) [2021-12-28 03:24:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2021-12-28 03:24:47,950 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2021-12-28 03:24:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:47,950 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2021-12-28 03:24:47,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2021-12-28 03:24:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 03:24:47,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:47,951 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-28 03:24:47,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:48,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-28 03:24:48,171 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2021-12-28 03:24:48,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340713271] [2021-12-28 03:24:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:48,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:24:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 03:24:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:24:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:48,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340713271] [2021-12-28 03:24:48,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340713271] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420870142] [2021-12-28 03:24:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:48,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:48,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:48,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 03:24:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:48,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-28 03:24:48,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 03:24:49,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:49,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420870142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:49,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:49,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2021-12-28 03:24:49,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908579567] [2021-12-28 03:24:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:49,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:49,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:24:49,044 INFO L87 Difference]: Start difference. First operand 628 states and 781 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:49,144 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2021-12-28 03:24:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:24:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2021-12-28 03:24:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:49,147 INFO L225 Difference]: With dead ends: 1262 [2021-12-28 03:24:49,147 INFO L226 Difference]: Without dead ends: 677 [2021-12-28 03:24:49,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:24:49,149 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 23 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:49,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1541 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-12-28 03:24:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2021-12-28 03:24:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2021-12-28 03:24:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-28 03:24:49,178 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-28 03:24:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:49,178 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-28 03:24:49,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-28 03:24:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 03:24:49,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:49,179 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-12-28 03:24:49,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:49,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:49,400 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2021-12-28 03:24:49,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:49,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147679919] [2021-12-28 03:24:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:49,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:24:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 03:24:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:24:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:49,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147679919] [2021-12-28 03:24:49,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147679919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539253821] [2021-12-28 03:24:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:49,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:49,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:49,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 03:24:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-28 03:24:50,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 03:24:50,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:50,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539253821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:50,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:50,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-28 03:24:50,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617862207] [2021-12-28 03:24:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:50,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:50,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:24:50,216 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:50,319 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2021-12-28 03:24:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:24:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2021-12-28 03:24:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:50,322 INFO L225 Difference]: With dead ends: 856 [2021-12-28 03:24:50,322 INFO L226 Difference]: Without dead ends: 821 [2021-12-28 03:24:50,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:24:50,323 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 186 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:50,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1935 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-12-28 03:24:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2021-12-28 03:24:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2021-12-28 03:24:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-28 03:24:50,352 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-28 03:24:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:50,352 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-28 03:24:50,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-28 03:24:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-28 03:24:50,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:50,354 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-12-28 03:24:50,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-28 03:24:50,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:50,567 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2021-12-28 03:24:50,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:50,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103303637] [2021-12-28 03:24:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:50,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:24:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 03:24:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:24:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 03:24:50,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:50,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103303637] [2021-12-28 03:24:50,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103303637] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:50,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25002897] [2021-12-28 03:24:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:50,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:50,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:50,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 03:24:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:51,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 03:24:51,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 03:24:51,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:24:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-28 03:24:51,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25002897] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:51,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-28 03:24:51,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2021-12-28 03:24:51,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802991278] [2021-12-28 03:24:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:51,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:24:51,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:24:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-28 03:24:51,668 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:24:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:52,021 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2021-12-28 03:24:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:24:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2021-12-28 03:24:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:52,036 INFO L225 Difference]: With dead ends: 1874 [2021-12-28 03:24:52,037 INFO L226 Difference]: Without dead ends: 1250 [2021-12-28 03:24:52,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:24:52,039 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 359 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:52,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 689 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:24:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-12-28 03:24:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2021-12-28 03:24:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 935 states have (on average 1.2117647058823529) internal successors, (1133), 943 states have internal predecessors, (1133), 163 states have call successors, (163), 92 states have call predecessors, (163), 111 states have return successors, (208), 174 states have call predecessors, (208), 159 states have call successors, (208) [2021-12-28 03:24:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2021-12-28 03:24:52,104 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2021-12-28 03:24:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:52,105 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2021-12-28 03:24:52,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:24:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2021-12-28 03:24:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 03:24:52,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:52,106 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2021-12-28 03:24:52,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:52,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-28 03:24:52,320 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2021-12-28 03:24:52,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:52,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511267744] [2021-12-28 03:24:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:52,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:24:52,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:52,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511267744] [2021-12-28 03:24:52,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511267744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:52,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9124251] [2021-12-28 03:24:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:52,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:52,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:52,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:52,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 03:24:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 03:24:53,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:24:53,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:53,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9124251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:53,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:53,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-28 03:24:53,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036104816] [2021-12-28 03:24:53,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:53,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:53,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:53,140 INFO L87 Difference]: Start difference. First operand 1210 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:53,219 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2021-12-28 03:24:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2021-12-28 03:24:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:53,222 INFO L225 Difference]: With dead ends: 1861 [2021-12-28 03:24:53,222 INFO L226 Difference]: Without dead ends: 697 [2021-12-28 03:24:53,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:24:53,225 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 13 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:53,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 589 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-28 03:24:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2021-12-28 03:24:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 515 states have (on average 1.2058252427184466) internal successors, (621), 520 states have internal predecessors, (621), 90 states have call successors, (90), 51 states have call predecessors, (90), 61 states have return successors, (112), 95 states have call predecessors, (112), 86 states have call successors, (112) [2021-12-28 03:24:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2021-12-28 03:24:53,256 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2021-12-28 03:24:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:53,256 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2021-12-28 03:24:53,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2021-12-28 03:24:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 03:24:53,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:53,257 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2021-12-28 03:24:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:53,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-28 03:24:53,471 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2021-12-28 03:24:53,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385175516] [2021-12-28 03:24:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:53,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:24:53,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385175516] [2021-12-28 03:24:53,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385175516] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614212537] [2021-12-28 03:24:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:53,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:53,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:53,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-28 03:24:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 03:24:54,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:24:54,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:54,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614212537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:54,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:54,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-28 03:24:54,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10778763] [2021-12-28 03:24:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:54,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:54,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:54,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:54,380 INFO L87 Difference]: Start difference. First operand 667 states and 823 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:54,498 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2021-12-28 03:24:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2021-12-28 03:24:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:54,502 INFO L225 Difference]: With dead ends: 1213 [2021-12-28 03:24:54,502 INFO L226 Difference]: Without dead ends: 1208 [2021-12-28 03:24:54,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:54,503 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 247 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:54,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:24:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-12-28 03:24:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2021-12-28 03:24:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 910 states have (on average 1.2142857142857142) internal successors, (1105), 917 states have internal predecessors, (1105), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-12-28 03:24:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2021-12-28 03:24:54,555 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2021-12-28 03:24:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:54,556 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2021-12-28 03:24:54,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:24:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2021-12-28 03:24:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-28 03:24:54,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:54,557 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-28 03:24:54,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-28 03:24:54,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-28 03:24:54,771 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2021-12-28 03:24:54,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:54,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524634881] [2021-12-28 03:24:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:54,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 03:24:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 03:24:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-28 03:24:55,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524634881] [2021-12-28 03:24:55,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524634881] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905110543] [2021-12-28 03:24:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:55,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:55,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:55,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-28 03:24:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:55,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 03:24:55,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-28 03:24:55,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:55,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905110543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:55,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:55,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-28 03:24:55,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632471452] [2021-12-28 03:24:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:55,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:55,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:55,750 INFO L87 Difference]: Start difference. First operand 1176 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 03:24:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:55,830 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2021-12-28 03:24:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:55,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2021-12-28 03:24:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:55,835 INFO L225 Difference]: With dead ends: 1368 [2021-12-28 03:24:55,835 INFO L226 Difference]: Without dead ends: 1358 [2021-12-28 03:24:55,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:24:55,837 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:55,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 446 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-12-28 03:24:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2021-12-28 03:24:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 916 states have (on average 1.212882096069869) internal successors, (1111), 923 states have internal predecessors, (1111), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-12-28 03:24:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2021-12-28 03:24:55,894 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2021-12-28 03:24:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:55,895 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2021-12-28 03:24:55,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 03:24:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2021-12-28 03:24:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-28 03:24:55,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:55,896 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-28 03:24:55,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:56,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-28 03:24:56,103 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2021-12-28 03:24:56,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:56,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166332442] [2021-12-28 03:24:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:56,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 03:24:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 03:24:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-28 03:24:56,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:56,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166332442] [2021-12-28 03:24:56,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166332442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:56,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316299301] [2021-12-28 03:24:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:56,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:56,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:56,349 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:56,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-28 03:24:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:56,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:24:56,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-28 03:24:57,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:57,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316299301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:57,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:57,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-28 03:24:57,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180140971] [2021-12-28 03:24:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:57,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:24:57,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:57,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:24:57,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:57,050 INFO L87 Difference]: Start difference. First operand 1182 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 03:24:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:57,120 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2021-12-28 03:24:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:24:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2021-12-28 03:24:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:57,125 INFO L225 Difference]: With dead ends: 2302 [2021-12-28 03:24:57,125 INFO L226 Difference]: Without dead ends: 1110 [2021-12-28 03:24:57,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:24:57,128 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:57,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 423 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-12-28 03:24:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2021-12-28 03:24:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.15521327014218) internal successors, (975), 851 states have internal predecessors, (975), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-12-28 03:24:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2021-12-28 03:24:57,195 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2021-12-28 03:24:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:57,196 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2021-12-28 03:24:57,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 03:24:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2021-12-28 03:24:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-28 03:24:57,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:57,197 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:57,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-28 03:24:57,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-28 03:24:57,419 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2021-12-28 03:24:57,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:57,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683169678] [2021-12-28 03:24:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:57,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:24:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 03:24:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-28 03:24:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 03:24:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:24:57,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683169678] [2021-12-28 03:24:57,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683169678] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402318088] [2021-12-28 03:24:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:57,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:57,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:57,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-28 03:24:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 03:24:58,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-28 03:24:58,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:58,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402318088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:58,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:58,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2021-12-28 03:24:58,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481853257] [2021-12-28 03:24:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:58,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:58,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:24:58,586 INFO L87 Difference]: Start difference. First operand 1110 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 03:24:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:58,717 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2021-12-28 03:24:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:24:58,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2021-12-28 03:24:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:58,722 INFO L225 Difference]: With dead ends: 2194 [2021-12-28 03:24:58,722 INFO L226 Difference]: Without dead ends: 1139 [2021-12-28 03:24:58,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:24:58,725 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 27 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:58,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1595 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-28 03:24:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2021-12-28 03:24:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.1492890995260663) internal successors, (970), 851 states have internal predecessors, (970), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-12-28 03:24:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2021-12-28 03:24:58,782 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2021-12-28 03:24:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:58,782 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2021-12-28 03:24:58,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 03:24:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2021-12-28 03:24:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-28 03:24:58,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:58,784 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:58,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-28 03:24:58,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-28 03:24:58,999 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2021-12-28 03:24:58,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795387176] [2021-12-28 03:24:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:58,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:24:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:24:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:24:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:24:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:24:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:24:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:24:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:24:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:24:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 03:24:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-28 03:24:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 03:24:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:24:59,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:59,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795387176] [2021-12-28 03:24:59,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795387176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:24:59,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426499863] [2021-12-28 03:24:59,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 03:24:59,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:24:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:59,224 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:24:59,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-28 03:24:59,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 03:24:59,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 03:24:59,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 03:24:59,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:24:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:24:59,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:24:59,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426499863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:59,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:24:59,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-28 03:24:59,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159735039] [2021-12-28 03:24:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:59,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:24:59,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:24:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:24:59,979 INFO L87 Difference]: Start difference. First operand 1110 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:00,021 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2021-12-28 03:25:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:25:00,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2021-12-28 03:25:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:00,026 INFO L225 Difference]: With dead ends: 1765 [2021-12-28 03:25:00,026 INFO L226 Difference]: Without dead ends: 717 [2021-12-28 03:25:00,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:25:00,028 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:00,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:25:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-28 03:25:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2021-12-28 03:25:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.138121546961326) internal successors, (618), 548 states have internal predecessors, (618), 100 states have call successors, (100), 61 states have call predecessors, (100), 69 states have return successors, (122), 103 states have call predecessors, (122), 96 states have call successors, (122) [2021-12-28 03:25:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2021-12-28 03:25:00,064 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2021-12-28 03:25:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:00,064 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2021-12-28 03:25:00,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2021-12-28 03:25:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-28 03:25:00,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:00,066 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:00,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-28 03:25:00,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:00,287 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2021-12-28 03:25:00,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:00,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383091508] [2021-12-28 03:25:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:00,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:25:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:25:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:25:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:25:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:25:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:25:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:25:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 03:25:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 03:25:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 03:25:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:25:00,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383091508] [2021-12-28 03:25:00,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383091508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403539950] [2021-12-28 03:25:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:00,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:00,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:00,528 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:00,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-28 03:25:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 03:25:01,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:25:01,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:25:01,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403539950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:01,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:25:01,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-28 03:25:01,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372088962] [2021-12-28 03:25:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:01,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:25:01,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:25:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:01,460 INFO L87 Difference]: Start difference. First operand 713 states and 840 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:01,708 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2021-12-28 03:25:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 03:25:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2021-12-28 03:25:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:01,711 INFO L225 Difference]: With dead ends: 1338 [2021-12-28 03:25:01,711 INFO L226 Difference]: Without dead ends: 653 [2021-12-28 03:25:01,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:25:01,713 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:01,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 511 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:25:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-12-28 03:25:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2021-12-28 03:25:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 456 states have (on average 1.1337719298245614) internal successors, (517), 461 states have internal predecessors, (517), 84 states have call successors, (84), 49 states have call predecessors, (84), 55 states have return successors, (102), 85 states have call predecessors, (102), 81 states have call successors, (102) [2021-12-28 03:25:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2021-12-28 03:25:01,759 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2021-12-28 03:25:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:01,759 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2021-12-28 03:25:01,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2021-12-28 03:25:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-28 03:25:01,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:01,761 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:01,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-28 03:25:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:01,983 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2021-12-28 03:25:01,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408985552] [2021-12-28 03:25:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:01,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:25:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:25:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:25:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:25:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:25:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:25:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:25:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 03:25:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 03:25:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 03:25:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:25:02,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408985552] [2021-12-28 03:25:02,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408985552] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042697403] [2021-12-28 03:25:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:02,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:02,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:02,242 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:02,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-28 03:25:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:02,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 03:25:02,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-28 03:25:03,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:25:03,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042697403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:03,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:25:03,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2021-12-28 03:25:03,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554841907] [2021-12-28 03:25:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:03,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:25:03,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:25:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:03,194 INFO L87 Difference]: Start difference. First operand 596 states and 703 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 03:25:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:03,348 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2021-12-28 03:25:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:25:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2021-12-28 03:25:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:03,351 INFO L225 Difference]: With dead ends: 1241 [2021-12-28 03:25:03,351 INFO L226 Difference]: Without dead ends: 673 [2021-12-28 03:25:03,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:25:03,353 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 35 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:03,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1714 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:25:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-12-28 03:25:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2021-12-28 03:25:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 488 states have (on average 1.1311475409836065) internal successors, (552), 490 states have internal predecessors, (552), 84 states have call successors, (84), 49 states have call predecessors, (84), 60 states have return successors, (110), 93 states have call predecessors, (110), 81 states have call successors, (110) [2021-12-28 03:25:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2021-12-28 03:25:03,385 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2021-12-28 03:25:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:03,386 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2021-12-28 03:25:03,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 03:25:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2021-12-28 03:25:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-28 03:25:03,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:03,387 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:03,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-28 03:25:03,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:03,604 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2021-12-28 03:25:03,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:03,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414396067] [2021-12-28 03:25:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:03,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:25:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:25:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:25:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:25:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:25:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:25:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:25:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 03:25:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 03:25:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 03:25:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:25:03,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:03,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414396067] [2021-12-28 03:25:03,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414396067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:03,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028069015] [2021-12-28 03:25:03,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 03:25:03,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:03,850 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:03,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-28 03:25:04,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 03:25:04,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 03:25:04,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 03:25:04,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:25:04,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:25:04,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028069015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:04,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:25:04,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-28 03:25:04,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918357735] [2021-12-28 03:25:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:04,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:25:04,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:04,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:25:04,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:25:04,725 INFO L87 Difference]: Start difference. First operand 633 states and 746 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:04,746 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2021-12-28 03:25:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:25:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2021-12-28 03:25:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:04,749 INFO L225 Difference]: With dead ends: 660 [2021-12-28 03:25:04,749 INFO L226 Difference]: Without dead ends: 259 [2021-12-28 03:25:04,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:25:04,750 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:04,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:25:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-28 03:25:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2021-12-28 03:25:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 189 states have internal predecessors, (203), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2021-12-28 03:25:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2021-12-28 03:25:04,767 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2021-12-28 03:25:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:04,768 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2021-12-28 03:25:04,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 03:25:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2021-12-28 03:25:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-12-28 03:25:04,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:04,770 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:04,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-28 03:25:04,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:04,983 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2021-12-28 03:25:04,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749625907] [2021-12-28 03:25:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:04,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:25:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 03:25:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:25:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:25:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:25:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:25:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 03:25:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 03:25:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 03:25:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 03:25:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-28 03:25:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-28 03:25:05,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749625907] [2021-12-28 03:25:05,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749625907] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762949263] [2021-12-28 03:25:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:05,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:05,227 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:05,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-28 03:25:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:05,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 03:25:05,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-28 03:25:06,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:25:06,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762949263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:06,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:25:06,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-28 03:25:06,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884595777] [2021-12-28 03:25:06,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:06,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:25:06,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:25:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:06,210 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-28 03:25:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:06,255 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2021-12-28 03:25:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:25:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 177 [2021-12-28 03:25:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:06,256 INFO L225 Difference]: With dead ends: 251 [2021-12-28 03:25:06,256 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 03:25:06,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:25:06,257 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:06,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:25:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 03:25:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 03:25:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:25:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 03:25:06,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2021-12-28 03:25:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:06,258 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 03:25:06,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-28 03:25:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 03:25:06,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 03:25:06,260 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:25:06,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-28 03:25:06,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:06,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 03:25:14,204 WARN L228 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-28 03:25:21,698 WARN L228 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-28 03:25:31,360 INFO L861 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2021-12-28 03:25:31,360 INFO L858 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2021-12-28 03:25:31,361 INFO L861 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2021-12-28 03:25:31,361 INFO L861 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2021-12-28 03:25:31,361 INFO L861 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2021-12-28 03:25:31,361 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-12-28 03:25:31,361 INFO L858 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2021-12-28 03:25:31,361 INFO L858 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2021-12-28 03:25:31,361 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2021-12-28 03:25:31,361 INFO L854 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,362 INFO L854 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,362 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2021-12-28 03:25:31,362 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2021-12-28 03:25:31,362 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2021-12-28 03:25:31,362 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2021-12-28 03:25:31,362 INFO L858 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2021-12-28 03:25:31,362 INFO L861 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2021-12-28 03:25:31,362 INFO L861 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2021-12-28 03:25:31,362 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L858 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L854 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 (not (= ~ldv_coherent_state~0 1)) .cse2 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2021-12-28 03:25:31,363 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L861 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2021-12-28 03:25:31,363 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-12-28 03:25:31,363 INFO L854 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,364 INFO L858 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2021-12-28 03:25:31,364 INFO L854 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,364 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-12-28 03:25:31,364 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-12-28 03:25:31,364 INFO L854 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0)) (and (= ~ldv_urb_state~0 0) (not (= (mod (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616) 0)))) [2021-12-28 03:25:31,364 INFO L854 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,364 INFO L858 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2021-12-28 03:25:31,364 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2021-12-28 03:25:31,364 INFO L861 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2021-12-28 03:25:31,365 INFO L861 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2021-12-28 03:25:31,365 INFO L861 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2021-12-28 03:25:31,365 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse2 (not (= ~ldv_coherent_state~0 1))) (.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_urb_state~0 1)) .cse1 .cse2 .cse3) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse3))) [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2021-12-28 03:25:31,365 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2021-12-28 03:25:31,366 INFO L854 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,366 INFO L858 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2021-12-28 03:25:31,366 INFO L861 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2021-12-28 03:25:31,366 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2021-12-28 03:25:31,366 INFO L861 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2021-12-28 03:25:31,366 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-12-28 03:25:31,366 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2021-12-28 03:25:31,366 INFO L861 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2021-12-28 03:25:31,367 INFO L858 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2021-12-28 03:25:31,367 INFO L854 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse3 (not (= |old(~ldv_coherent_state~0)| 1)))) (and (let ((.cse1 (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base)) (.cse2 (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset))) (or .cse0 (and (= |usb_free_coherent_#in~addr.base| 0) (<= 1 ~ldv_coherent_state~0) (= |usb_free_coherent_#in~addr.offset| 0) .cse1 .cse2) .cse3 (and (= ~ldv_coherent_state~0 0) .cse1 .cse2))) (or (not (= (mod (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset) 18446744073709551616) 0)) .cse0 (not (= 0 ~res_kbtab_probe_3~0)) .cse3))) [2021-12-28 03:25:31,367 INFO L854 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (= ~ldv_coherent_state~0 1) (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-12-28 03:25:31,367 INFO L858 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2021-12-28 03:25:31,367 INFO L854 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-12-28 03:25:31,367 INFO L858 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2021-12-28 03:25:31,367 INFO L861 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2021-12-28 03:25:31,367 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-12-28 03:25:31,367 INFO L854 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 1) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-12-28 03:25:31,368 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-12-28 03:25:31,368 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-12-28 03:25:31,368 INFO L854 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,368 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-12-28 03:25:31,368 INFO L854 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-28 03:25:31,368 INFO L854 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,368 INFO L854 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-28 03:25:31,368 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L854 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L854 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-12-28 03:25:31,369 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-12-28 03:25:31,370 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-12-28 03:25:31,370 INFO L854 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,370 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-12-28 03:25:31,370 INFO L854 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,370 INFO L854 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse5 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse3 .cse4 .cse5 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse6) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse6) .cse5 .cse1 .cse2 (not .cse4)))) [2021-12-28 03:25:31,370 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-12-28 03:25:31,370 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-12-28 03:25:31,370 INFO L854 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-28 03:25:31,371 INFO L858 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2021-12-28 03:25:31,371 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2021-12-28 03:25:31,371 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-12-28 03:25:31,378 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-12-28 03:25:31,379 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-12-28 03:25:31,379 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-12-28 03:25:31,379 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-12-28 03:25:31,379 INFO L854 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,379 INFO L854 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-28 03:25:31,379 INFO L854 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse5 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse6 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse5 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 .cse1 (not .cse4) .cse2 .cse6 .cse3))) [2021-12-28 03:25:31,379 INFO L858 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2021-12-28 03:25:31,379 INFO L854 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-28 03:25:31,380 INFO L858 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2021-12-28 03:25:31,380 INFO L858 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2021-12-28 03:25:31,380 INFO L854 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 03:25:31,381 INFO L858 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-28 03:25:31,381 INFO L854 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,382 INFO L858 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2021-12-28 03:25:31,382 INFO L854 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2021-12-28 03:25:31,382 INFO L854 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,382 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-12-28 03:25:31,382 INFO L854 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2021-12-28 03:25:31,382 INFO L858 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2021-12-28 03:25:31,382 INFO L854 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,382 INFO L858 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2021-12-28 03:25:31,383 INFO L854 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 03:25:31,383 INFO L858 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2021-12-28 03:25:31,383 INFO L854 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,383 INFO L854 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,383 INFO L858 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2021-12-28 03:25:31,383 INFO L854 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,384 INFO L858 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2021-12-28 03:25:31,384 INFO L854 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-28 03:25:31,384 INFO L854 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,384 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-28 03:25:31,384 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-12-28 03:25:31,384 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-12-28 03:25:31,384 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-12-28 03:25:31,384 INFO L854 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-28 03:25:31,384 INFO L854 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2021-12-28 03:25:31,385 INFO L854 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2021-12-28 03:25:31,385 INFO L854 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2021-12-28 03:25:31,385 INFO L854 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-12-28 03:25:31,385 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-12-28 03:25:31,385 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 03:25:31,385 INFO L854 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,385 INFO L858 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2021-12-28 03:25:31,385 INFO L854 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,386 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-12-28 03:25:31,386 INFO L858 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2021-12-28 03:25:31,386 INFO L854 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (or (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.base| 0)) (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.offset| 0))) .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-12-28 03:25:31,386 INFO L854 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse6 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)))) (.cse5 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (let ((.cse4 (not .cse7))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5))) (= 0 ~res_kbtab_probe_3~0) .cse8 (= ~ldv_urb_state~0 1)) (and .cse0 .cse1 .cse7 (= ~ldv_urb_state~0 0) .cse8 .cse2 .cse3 .cse6 .cse5 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)))) [2021-12-28 03:25:31,386 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-12-28 03:25:31,386 INFO L854 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-28 03:25:31,386 INFO L858 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2021-12-28 03:25:31,387 INFO L854 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-28 03:25:31,387 INFO L854 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|)))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 .cse4 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2021-12-28 03:25:31,387 INFO L854 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-28 03:25:31,387 INFO L861 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2021-12-28 03:25:31,387 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2021-12-28 03:25:31,388 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2021-12-28 03:25:31,388 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-12-28 03:25:31,388 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2021-12-28 03:25:31,388 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2021-12-28 03:25:31,389 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2021-12-28 03:25:31,391 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:31,392 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:25:31,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:25:31 BoogieIcfgContainer [2021-12-28 03:25:31,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:25:31,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:25:31,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:25:31,437 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:25:31,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:24:39" (3/4) ... [2021-12-28 03:25:31,439 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 03:25:31,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2021-12-28 03:25:31,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2021-12-28 03:25:31,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-28 03:25:31,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2021-12-28 03:25:31,450 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2021-12-28 03:25:31,451 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-12-28 03:25:31,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-12-28 03:25:31,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-12-28 03:25:31,466 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-28 03:25:31,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-28 03:25:31,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 03:25:31,498 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) [2021-12-28 03:25:31,498 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) [2021-12-28 03:25:31,498 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) [2021-12-28 03:25:31,500 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) [2021-12-28 03:25:31,500 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-12-28 03:25:31,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) [2021-12-28 03:25:31,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2021-12-28 03:25:31,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) [2021-12-28 03:25:31,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,503 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-28 03:25:31,503 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2021-12-28 03:25:31,599 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 03:25:31,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:25:31,600 INFO L158 Benchmark]: Toolchain (without parser) took 53885.04ms. Allocated memory was 69.2MB in the beginning and 805.3MB in the end (delta: 736.1MB). Free memory was 49.5MB in the beginning and 493.0MB in the end (delta: -443.4MB). Peak memory consumption was 292.5MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,601 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:25:31,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.92ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 49.3MB in the beginning and 61.4MB in the end (delta: -12.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.78ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 56.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,601 INFO L158 Benchmark]: Boogie Preprocessor took 91.13ms. Allocated memory is still 96.5MB. Free memory was 56.0MB in the beginning and 50.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,603 INFO L158 Benchmark]: RCFGBuilder took 876.44ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 50.9MB in the beginning and 64.8MB in the end (delta: -13.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,604 INFO L158 Benchmark]: TraceAbstraction took 51882.87ms. Allocated memory was 123.7MB in the beginning and 805.3MB in the end (delta: 681.6MB). Free memory was 64.8MB in the beginning and 556.4MB in the end (delta: -491.5MB). Peak memory consumption was 488.9MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,604 INFO L158 Benchmark]: Witness Printer took 163.41ms. Allocated memory is still 805.3MB. Free memory was 555.3MB in the beginning and 493.0MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2021-12-28 03:25:31,609 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.92ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 49.3MB in the beginning and 61.4MB in the end (delta: -12.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.78ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 56.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.13ms. Allocated memory is still 96.5MB. Free memory was 56.0MB in the beginning and 50.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 876.44ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 50.9MB in the beginning and 64.8MB in the end (delta: -13.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51882.87ms. Allocated memory was 123.7MB in the beginning and 805.3MB in the end (delta: 681.6MB). Free memory was 64.8MB in the beginning and 556.4MB in the end (delta: -491.5MB). Peak memory consumption was 488.9MB. Max. memory is 16.1GB. * Witness Printer took 163.41ms. Allocated memory is still 805.3MB. Free memory was 555.3MB in the beginning and 493.0MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2905 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 19770 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14762 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1963 IncrementalHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 5008 mSDtfsCounter, 1963 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3038 GetRequests, 2742 SyntacticMatches, 8 SemanticMatches, 288 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=13, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377649 FormulaSimplificationTreeSizeReduction, 15.5s HoareSimplificationTime, 81 FomulaSimplificationsInter, 268966 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9786 SizeOfPredicates, 86 NumberOfNonLiveVariables, 27892 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 1329/1543 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant [2021-12-28 03:25:31,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant [2021-12-28 03:25:31,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) - InvariantResult [Line: 4124]: Loop Invariant [2021-12-28 03:25:31,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 03:25:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 03:25:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) RESULT: Ultimate proved your program to be correct! [2021-12-28 03:25:31,670 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: TRUE