./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 ff03de63 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-ff03de6 [2021-12-21 15:39:44,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:39:44,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:39:44,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:39:44,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:39:44,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:39:44,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:39:44,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:39:44,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:39:44,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:39:44,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:39:44,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:39:44,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:39:44,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:39:44,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:39:44,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:39:44,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:39:44,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:39:44,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:39:44,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:39:44,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:39:44,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:39:44,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:39:44,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:39:44,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:39:44,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:39:44,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:39:44,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:39:44,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:39:44,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:39:44,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:39:44,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:39:44,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:39:44,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:39:44,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:39:44,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:39:44,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:39:44,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:39:44,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:39:44,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:39:44,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:39:44,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 15:39:44,196 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:39:44,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:39:44,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:39:44,197 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:39:44,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:39:44,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:39:44,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:39:44,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:39:44,199 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:39:44,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:39:44,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:39:44,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:39:44,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:39:44,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:39:44,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:39:44,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:39:44,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:39:44,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:39:44,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:39:44,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:39:44,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:39:44,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:39:44,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:39:44,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:39:44,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:39:44,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:39:44,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:39:44,204 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:39:44,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:39:44,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:39:44,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:39:44,204 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-21 15:39:44,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:39:44,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:39:44,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:39:44,436 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:39:44,437 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:39:44,438 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-21 15:39:44,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bb3d922/2838cec8e1ed48659f9d28d0147a6e3a/FLAG2b583e20f [2021-12-21 15:39:45,068 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:39:45,069 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-21 15:39:45,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bb3d922/2838cec8e1ed48659f9d28d0147a6e3a/FLAG2b583e20f [2021-12-21 15:39:45,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bb3d922/2838cec8e1ed48659f9d28d0147a6e3a [2021-12-21 15:39:45,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:39:45,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:39:45,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:39:45,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:39:45,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:39:45,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:39:45" (1/1) ... [2021-12-21 15:39:45,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56876f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:45, skipping insertion in model container [2021-12-21 15:39:45,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:39:45" (1/1) ... [2021-12-21 15:39:45,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:39:45,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:39:46,179 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-21 15:39:46,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:39:46,227 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:39:46,359 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-21 15:39:46,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:39:46,414 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:39:46,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46 WrapperNode [2021-12-21 15:39:46,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:39:46,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:39:46,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:39:46,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:39:46,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,509 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2021-12-21 15:39:46,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:39:46,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:39:46,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:39:46,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:39:46,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:39:46,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:39:46,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:39:46,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:39:46,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (1/1) ... [2021-12-21 15:39:46,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:39:46,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:46,636 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-21 15:39:46,663 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-21 15:39:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2021-12-21 15:39:46,678 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2021-12-21 15:39:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:39:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-12-21 15:39:46,679 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-12-21 15:39:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 15:39:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-12-21 15:39:46,679 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-12-21 15:39:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2021-12-21 15:39:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2021-12-21 15:39:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-21 15:39:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-21 15:39:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 15:39:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 15:39:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-21 15:39:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-21 15:39:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 15:39:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 15:39:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-21 15:39:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-21 15:39:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:39:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-12-21 15:39:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-12-21 15:39:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 15:39:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-21 15:39:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-21 15:39:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:39:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-21 15:39:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-21 15:39:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-21 15:39:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-21 15:39:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-21 15:39:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-21 15:39:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-21 15:39:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-21 15:39:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:39:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 15:39:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:39:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:39:46,937 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:39:46,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:39:47,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-21 15:39:47,054 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 15:39:47,651 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-21 15:39:47,651 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-21 15:39:47,661 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:39:47,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:39:47,668 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-21 15:39:47,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:39:47 BoogieIcfgContainer [2021-12-21 15:39:47,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:39:47,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:39:47,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:39:47,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:39:47,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:39:45" (1/3) ... [2021-12-21 15:39:47,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e86ea90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:39:47, skipping insertion in model container [2021-12-21 15:39:47,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:39:46" (2/3) ... [2021-12-21 15:39:47,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e86ea90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:39:47, skipping insertion in model container [2021-12-21 15:39:47,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:39:47" (3/3) ... [2021-12-21 15:39:47,677 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-21 15:39:47,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:39:47,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 15:39:47,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:39:47,726 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-21 15:39:47,727 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 15:39:47,745 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-21 15:39:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 15:39:47,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:47,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:39:47,750 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2021-12-21 15:39:47,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:47,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800890555] [2021-12-21 15:39:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:47,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,163 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-21 15:39:48,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800890555] [2021-12-21 15:39:48,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800890555] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:48,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:39:48,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 15:39:48,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119969156] [2021-12-21 15:39:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:48,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:39:48,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:39:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:39:48,194 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-21 15:39:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:48,303 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2021-12-21 15:39:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:39:48,306 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-21 15:39:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:48,324 INFO L225 Difference]: With dead ends: 447 [2021-12-21 15:39:48,325 INFO L226 Difference]: Without dead ends: 287 [2021-12-21 15:39:48,331 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-21 15:39:48,334 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-21 15:39:48,336 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-21 15:39:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-21 15:39:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2021-12-21 15:39:48,434 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-21 15:39:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2021-12-21 15:39:48,440 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2021-12-21 15:39:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:48,440 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2021-12-21 15:39:48,441 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-21 15:39:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2021-12-21 15:39:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 15:39:48,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:48,442 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-21 15:39:48,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:39:48,442 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2021-12-21 15:39:48,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:48,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375310262] [2021-12-21 15:39:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:48,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,603 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-21 15:39:48,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:48,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375310262] [2021-12-21 15:39:48,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375310262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:48,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:39:48,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 15:39:48,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058518573] [2021-12-21 15:39:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:48,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:39:48,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:39:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:39:48,613 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-21 15:39:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:48,658 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2021-12-21 15:39:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:39:48,659 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-21 15:39:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:48,664 INFO L225 Difference]: With dead ends: 820 [2021-12-21 15:39:48,665 INFO L226 Difference]: Without dead ends: 542 [2021-12-21 15:39:48,666 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-21 15:39:48,667 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-21 15:39:48,667 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-21 15:39:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-12-21 15:39:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2021-12-21 15:39:48,705 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-21 15:39:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2021-12-21 15:39:48,711 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2021-12-21 15:39:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:48,711 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2021-12-21 15:39:48,711 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-21 15:39:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2021-12-21 15:39:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 15:39:48,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:48,713 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-21 15:39:48,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:39:48,714 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2021-12-21 15:39:48,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:48,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15196460] [2021-12-21 15:39:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:48,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 15:39:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:48,919 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-21 15:39:48,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:48,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15196460] [2021-12-21 15:39:48,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15196460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:48,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:39:48,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:39:48,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915480660] [2021-12-21 15:39:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:48,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:39:48,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:39:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:39:48,924 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-21 15:39:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:49,192 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2021-12-21 15:39:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:39:49,193 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-21 15:39:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:49,198 INFO L225 Difference]: With dead ends: 1114 [2021-12-21 15:39:49,199 INFO L226 Difference]: Without dead ends: 587 [2021-12-21 15:39:49,202 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-21 15:39:49,204 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:39:49,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 846 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:39:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-12-21 15:39:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2021-12-21 15:39:49,238 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-21 15:39:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2021-12-21 15:39:49,259 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2021-12-21 15:39:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:49,259 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2021-12-21 15:39:49,259 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-21 15:39:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2021-12-21 15:39:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 15:39:49,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:49,261 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-21 15:39:49,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:39:49,261 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2021-12-21 15:39:49,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:49,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700177167] [2021-12-21 15:39:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:49,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 15:39:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:39:49,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700177167] [2021-12-21 15:39:49,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700177167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:49,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:39:49,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:39:49,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609576585] [2021-12-21 15:39:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:49,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:39:49,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:39:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:39:49,385 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-21 15:39:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:49,637 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2021-12-21 15:39:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:39:49,638 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-21 15:39:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:49,641 INFO L225 Difference]: With dead ends: 1233 [2021-12-21 15:39:49,641 INFO L226 Difference]: Without dead ends: 709 [2021-12-21 15:39:49,643 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-21 15:39:49,644 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 206 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:39:49,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 488 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:39:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-21 15:39:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2021-12-21 15:39:49,679 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-21 15:39:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2021-12-21 15:39:49,682 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2021-12-21 15:39:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:49,683 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2021-12-21 15:39:49,683 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-21 15:39:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2021-12-21 15:39:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 15:39:49,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:49,685 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-21 15:39:49,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:39:49,686 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2021-12-21 15:39:49,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:49,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528009171] [2021-12-21 15:39:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:49,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:49,952 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-21 15:39:49,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:49,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528009171] [2021-12-21 15:39:49,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528009171] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:49,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322367945] [2021-12-21 15:39:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:49,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:49,959 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-21 15:39:49,971 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-21 15:39:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:50,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 15:39:50,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:50,560 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-21 15:39:50,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:50,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322367945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:50,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:50,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-21 15:39:50,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988907652] [2021-12-21 15:39:50,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:50,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:39:50,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:39:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:39:50,563 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-21 15:39:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:50,620 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2021-12-21 15:39:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:39:50,621 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-21 15:39:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:50,624 INFO L225 Difference]: With dead ends: 1189 [2021-12-21 15:39:50,624 INFO L226 Difference]: Without dead ends: 596 [2021-12-21 15:39:50,626 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-21 15:39:50,626 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-21 15:39:50,627 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-21 15:39:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-21 15:39:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-21 15:39:50,648 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-21 15:39:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2021-12-21 15:39:50,650 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2021-12-21 15:39:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:50,651 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2021-12-21 15:39:50,651 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-21 15:39:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2021-12-21 15:39:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 15:39:50,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:50,656 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-21 15:39:50,687 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-21 15:39:50,873 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-21 15:39:50,874 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2021-12-21 15:39:50,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121884008] [2021-12-21 15:39:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:50,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:39:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 15:39:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,188 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-21 15:39:51,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121884008] [2021-12-21 15:39:51,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121884008] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498371145] [2021-12-21 15:39:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:51,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:51,191 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-21 15:39:51,192 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-21 15:39:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:51,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-21 15:39:51,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:51,768 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-21 15:39:51,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:51,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498371145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:51,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:51,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-12-21 15:39:51,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354781643] [2021-12-21 15:39:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:51,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:39:51,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:39:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:39:51,772 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-21 15:39:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:51,885 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2021-12-21 15:39:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:39:51,886 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-21 15:39:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:51,889 INFO L225 Difference]: With dead ends: 906 [2021-12-21 15:39:51,889 INFO L226 Difference]: Without dead ends: 596 [2021-12-21 15:39:51,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-12-21 15:39:51,891 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 15:39:51,891 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-21 15:39:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-21 15:39:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-21 15:39:51,919 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-21 15:39:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2021-12-21 15:39:51,921 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2021-12-21 15:39:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:51,922 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2021-12-21 15:39:51,922 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-21 15:39:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2021-12-21 15:39:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 15:39:51,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:51,923 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-21 15:39:51,943 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-21 15:39:52,131 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-21 15:39:52,132 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2021-12-21 15:39:52,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646643305] [2021-12-21 15:39:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:52,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,376 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-21 15:39:52,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:52,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646643305] [2021-12-21 15:39:52,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646643305] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:52,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374835998] [2021-12-21 15:39:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:52,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:52,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:52,377 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-21 15:39:52,379 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-21 15:39:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:52,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:39:52,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:52,917 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-21 15:39:52,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:52,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374835998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:52,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:52,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-21 15:39:52,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50332143] [2021-12-21 15:39:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:52,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:39:52,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:39:52,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:39:52,919 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-21 15:39:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:53,074 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2021-12-21 15:39:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:39:53,075 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-21 15:39:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:53,079 INFO L225 Difference]: With dead ends: 661 [2021-12-21 15:39:53,079 INFO L226 Difference]: Without dead ends: 658 [2021-12-21 15:39:53,079 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-21 15:39:53,080 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-21 15:39:53,080 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-21 15:39:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-12-21 15:39:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2021-12-21 15:39:53,109 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-21 15:39:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2021-12-21 15:39:53,112 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2021-12-21 15:39:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:53,114 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2021-12-21 15:39:53,114 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-21 15:39:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2021-12-21 15:39:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-21 15:39:53,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:53,119 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-21 15:39:53,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 15:39:53,327 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-21 15:39:53,327 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:53,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2021-12-21 15:39:53,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:53,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208110790] [2021-12-21 15:39:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:53,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:39:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-21 15:39:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,468 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-21 15:39:53,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208110790] [2021-12-21 15:39:53,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208110790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:53,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:39:53,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:39:53,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721998594] [2021-12-21 15:39:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:53,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:39:53,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:39:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:39:53,470 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-21 15:39:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:53,710 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2021-12-21 15:39:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:39:53,711 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-21 15:39:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:53,714 INFO L225 Difference]: With dead ends: 1320 [2021-12-21 15:39:53,714 INFO L226 Difference]: Without dead ends: 685 [2021-12-21 15:39:53,736 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-21 15:39:53,737 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 163 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:39:53,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 647 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:39:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-12-21 15:39:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2021-12-21 15:39:53,768 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-21 15:39:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2021-12-21 15:39:53,771 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2021-12-21 15:39:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:53,771 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2021-12-21 15:39:53,771 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-21 15:39:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2021-12-21 15:39:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 15:39:53,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:53,773 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-21 15:39:53,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:39:53,773 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2021-12-21 15:39:53,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:53,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839980922] [2021-12-21 15:39:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:53,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:39:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:39:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:54,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:39:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:54,027 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-21 15:39:54,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:54,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839980922] [2021-12-21 15:39:54,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839980922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:54,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954188297] [2021-12-21 15:39:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:54,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:54,032 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-21 15:39:54,057 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-21 15:39:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:54,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-21 15:39:54,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:55,022 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-21 15:39:55,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 15:39:55,162 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-21 15:39:55,181 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 15:39:55,181 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-21 15:39:55,216 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-21 15:39:55,218 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-21 15:39:55,354 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-21 15:39:55,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:55,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954188297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:55,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:55,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-12-21 15:39:55,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238596016] [2021-12-21 15:39:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:55,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:39:55,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:39:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2021-12-21 15:39:55,358 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-21 15:39:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:55,801 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2021-12-21 15:39:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:39:55,802 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-21 15:39:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:55,804 INFO L225 Difference]: With dead ends: 702 [2021-12-21 15:39:55,805 INFO L226 Difference]: Without dead ends: 661 [2021-12-21 15:39:55,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2021-12-21 15:39:55,806 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 15:39:55,806 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-21 15:39:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-12-21 15:39:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-12-21 15:39:55,839 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-21 15:39:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2021-12-21 15:39:55,842 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2021-12-21 15:39:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:55,843 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2021-12-21 15:39:55,843 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-21 15:39:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2021-12-21 15:39:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 15:39:55,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:55,844 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-21 15:39:55,871 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-21 15:39:56,061 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-21 15:39:56,062 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2021-12-21 15:39:56,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:56,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516756622] [2021-12-21 15:39:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:56,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:39:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:39:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:39:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,342 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-21 15:39:56,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516756622] [2021-12-21 15:39:56,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516756622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658728485] [2021-12-21 15:39:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:56,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:56,344 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-21 15:39:56,365 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-21 15:39:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:56,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 15:39:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:56,940 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-21 15:39:56,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:56,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658728485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:56,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:56,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-21 15:39:56,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380583179] [2021-12-21 15:39:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:56,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:39:56,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:39:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:39:56,943 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-21 15:39:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:57,073 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2021-12-21 15:39:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:39:57,073 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-21 15:39:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:57,077 INFO L225 Difference]: With dead ends: 1390 [2021-12-21 15:39:57,077 INFO L226 Difference]: Without dead ends: 810 [2021-12-21 15:39:57,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-21 15:39:57,079 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-21 15:39:57,079 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-21 15:39:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-12-21 15:39:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2021-12-21 15:39:57,113 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-21 15:39:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2021-12-21 15:39:57,116 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2021-12-21 15:39:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:57,116 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2021-12-21 15:39:57,116 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-21 15:39:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2021-12-21 15:39:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-21 15:39:57,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:57,118 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-21 15:39:57,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 15:39:57,331 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-21 15:39:57,331 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2021-12-21 15:39:57,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:57,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623300569] [2021-12-21 15:39:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:57,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:39:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 15:39:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-21 15:39:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:57,611 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-21 15:39:57,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623300569] [2021-12-21 15:39:57,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623300569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042810024] [2021-12-21 15:39:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:57,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:57,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:57,613 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-21 15:39:57,643 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-21 15:39:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:58,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-21 15:39:58,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:58,367 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-21 15:39:58,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:58,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042810024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:58,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:58,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2021-12-21 15:39:58,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374125873] [2021-12-21 15:39:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:58,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:39:58,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:39:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2021-12-21 15:39:58,369 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-21 15:39:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:58,498 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2021-12-21 15:39:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:39:58,498 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-21 15:39:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:58,501 INFO L225 Difference]: With dead ends: 1262 [2021-12-21 15:39:58,501 INFO L226 Difference]: Without dead ends: 677 [2021-12-21 15:39:58,503 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-21 15:39:58,503 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-21 15:39:58,504 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-21 15:39:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-12-21 15:39:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2021-12-21 15:39:58,539 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-21 15:39:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-21 15:39:58,542 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-21 15:39:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:58,542 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-21 15:39:58,543 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-21 15:39:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-21 15:39:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-21 15:39:58,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:58,544 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-21 15:39:58,573 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-21 15:39:58,770 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-21 15:39:58,771 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:39:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:39:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2021-12-21 15:39:58,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:39:58,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699580425] [2021-12-21 15:39:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:58,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:39:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:39:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:58,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:39:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:58,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:39:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:39:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:39:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:39:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:39:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:39:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 15:39:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-21 15:39:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,063 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-21 15:39:59,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:39:59,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699580425] [2021-12-21 15:39:59,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699580425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:39:59,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152304785] [2021-12-21 15:39:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:39:59,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:39:59,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:39:59,065 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-21 15:39:59,067 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-21 15:39:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:39:59,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 15:39:59,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:39:59,730 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-21 15:39:59,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:39:59,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152304785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:39:59,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:39:59,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-21 15:39:59,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582288025] [2021-12-21 15:39:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:39:59,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:39:59,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:39:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:39:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:39:59,733 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-21 15:39:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:39:59,854 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2021-12-21 15:39:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:39:59,854 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-21 15:39:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:39:59,858 INFO L225 Difference]: With dead ends: 856 [2021-12-21 15:39:59,858 INFO L226 Difference]: Without dead ends: 821 [2021-12-21 15:39:59,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-12-21 15:39:59,860 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:39:59,860 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.1s Time] [2021-12-21 15:39:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-12-21 15:39:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2021-12-21 15:39:59,897 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-21 15:39:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-21 15:39:59,900 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-21 15:39:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:39:59,900 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-21 15:39:59,900 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-21 15:39:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-21 15:39:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 15:39:59,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:39:59,902 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-21 15:39:59,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 15:40:00,115 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-21 15:40:00,115 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2021-12-21 15:40:00,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688140969] [2021-12-21 15:40:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:00,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:40:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 15:40:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-21 15:40:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,396 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-21 15:40:00,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688140969] [2021-12-21 15:40:00,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688140969] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068125898] [2021-12-21 15:40:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:00,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:00,398 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-21 15:40:00,400 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-21 15:40:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:00,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 15:40:00,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:01,113 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-21 15:40:01,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:40:01,408 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-21 15:40:01,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068125898] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:01,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 15:40:01,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2021-12-21 15:40:01,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085760723] [2021-12-21 15:40:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:01,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:40:01,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:40:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-21 15:40:01,411 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-21 15:40:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:01,830 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2021-12-21 15:40:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 15:40:01,830 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-21 15:40:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:01,835 INFO L225 Difference]: With dead ends: 1874 [2021-12-21 15:40:01,835 INFO L226 Difference]: Without dead ends: 1250 [2021-12-21 15:40:01,838 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-21 15:40:01,839 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-21 15:40:01,839 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-21 15:40:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-12-21 15:40:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2021-12-21 15:40:01,924 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-21 15:40:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2021-12-21 15:40:01,928 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2021-12-21 15:40:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:01,929 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2021-12-21 15:40:01,929 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-21 15:40:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2021-12-21 15:40:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-21 15:40:01,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:01,931 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-21 15:40:01,960 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-21 15:40:02,157 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-21 15:40:02,158 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2021-12-21 15:40:02,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067366356] [2021-12-21 15:40:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:02,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,409 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-21 15:40:02,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067366356] [2021-12-21 15:40:02,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067366356] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574295431] [2021-12-21 15:40:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:02,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:02,411 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-21 15:40:02,413 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-21 15:40:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:02,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 15:40:02,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:03,085 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-21 15:40:03,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:03,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574295431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:03,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:03,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-21 15:40:03,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269932379] [2021-12-21 15:40:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:03,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:40:03,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:40:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:40:03,086 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-21 15:40:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:03,177 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2021-12-21 15:40:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:40:03,178 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-21 15:40:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:03,181 INFO L225 Difference]: With dead ends: 1861 [2021-12-21 15:40:03,181 INFO L226 Difference]: Without dead ends: 697 [2021-12-21 15:40:03,183 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-21 15:40:03,184 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-21 15:40:03,184 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-21 15:40:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-21 15:40:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2021-12-21 15:40:03,224 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-21 15:40:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2021-12-21 15:40:03,227 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2021-12-21 15:40:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:03,227 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2021-12-21 15:40:03,227 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-21 15:40:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2021-12-21 15:40:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-21 15:40:03,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:03,229 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-21 15:40:03,260 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-21 15:40:03,443 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-21 15:40:03,443 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2021-12-21 15:40:03,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:03,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977266303] [2021-12-21 15:40:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:03,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:03,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-21 15:40:03,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977266303] [2021-12-21 15:40:03,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977266303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577415432] [2021-12-21 15:40:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:03,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:03,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:03,697 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-21 15:40:03,724 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-21 15:40:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:04,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:40:04,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:04,462 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-21 15:40:04,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:04,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577415432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:04,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:04,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-21 15:40:04,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827255813] [2021-12-21 15:40:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:04,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:40:04,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:40:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:40:04,490 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-21 15:40:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:04,646 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2021-12-21 15:40:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:40:04,646 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-21 15:40:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:04,651 INFO L225 Difference]: With dead ends: 1213 [2021-12-21 15:40:04,651 INFO L226 Difference]: Without dead ends: 1208 [2021-12-21 15:40:04,653 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-21 15:40:04,655 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-21 15:40:04,655 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-21 15:40:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-12-21 15:40:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2021-12-21 15:40:04,727 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-21 15:40:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2021-12-21 15:40:04,730 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2021-12-21 15:40:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:04,731 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2021-12-21 15:40:04,731 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-21 15:40:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2021-12-21 15:40:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-21 15:40:04,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:04,732 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-21 15:40:04,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 15:40:04,947 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-21 15:40:04,947 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2021-12-21 15:40:04,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:04,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703048698] [2021-12-21 15:40:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:04,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-21 15:40:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-21 15:40:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,215 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-21 15:40:05,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:05,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703048698] [2021-12-21 15:40:05,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703048698] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:05,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894658960] [2021-12-21 15:40:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:05,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:05,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:05,217 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-21 15:40:05,219 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-21 15:40:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:05,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:40:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:05,981 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-21 15:40:05,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:05,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894658960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:05,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:05,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-21 15:40:05,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319544023] [2021-12-21 15:40:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:05,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:40:05,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:05,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:40:05,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:40:05,983 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-21 15:40:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:06,095 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2021-12-21 15:40:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:40:06,096 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-21 15:40:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:06,101 INFO L225 Difference]: With dead ends: 1368 [2021-12-21 15:40:06,101 INFO L226 Difference]: Without dead ends: 1358 [2021-12-21 15:40:06,102 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-21 15:40:06,108 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-21 15:40:06,109 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-21 15:40:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-12-21 15:40:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2021-12-21 15:40:06,186 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-21 15:40:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2021-12-21 15:40:06,190 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2021-12-21 15:40:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:06,190 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2021-12-21 15:40:06,191 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-21 15:40:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2021-12-21 15:40:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-21 15:40:06,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:06,192 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-21 15:40:06,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-21 15:40:06,419 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-21 15:40:06,420 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2021-12-21 15:40:06,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:06,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428043943] [2021-12-21 15:40:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:06,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-21 15:40:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-21 15:40:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:06,707 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-21 15:40:06,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:06,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428043943] [2021-12-21 15:40:06,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428043943] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:06,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416083967] [2021-12-21 15:40:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:06,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:06,712 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-21 15:40:06,713 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-21 15:40:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:07,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 15:40:07,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:07,519 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-21 15:40:07,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:07,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416083967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:07,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:07,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-21 15:40:07,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303275636] [2021-12-21 15:40:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:07,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:40:07,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:40:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:40:07,521 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-21 15:40:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:07,618 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2021-12-21 15:40:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 15:40:07,619 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-21 15:40:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:07,624 INFO L225 Difference]: With dead ends: 2302 [2021-12-21 15:40:07,625 INFO L226 Difference]: Without dead ends: 1110 [2021-12-21 15:40:07,627 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-21 15:40:07,628 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-21 15:40:07,628 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-21 15:40:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-12-21 15:40:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2021-12-21 15:40:07,719 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-21 15:40:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2021-12-21 15:40:07,722 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2021-12-21 15:40:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:07,723 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2021-12-21 15:40:07,723 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-21 15:40:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2021-12-21 15:40:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-21 15:40:07,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:07,725 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-21 15:40:07,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 15:40:07,939 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-21 15:40:07,939 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2021-12-21 15:40:07,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:07,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826785492] [2021-12-21 15:40:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:07,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 15:40:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-21 15:40:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-21 15:40:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,257 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-21 15:40:08,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826785492] [2021-12-21 15:40:08,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826785492] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150223748] [2021-12-21 15:40:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:08,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:08,260 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-21 15:40:08,262 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-21 15:40:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:08,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-21 15:40:08,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:09,208 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-21 15:40:09,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:09,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150223748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:09,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:09,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2021-12-21 15:40:09,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20250573] [2021-12-21 15:40:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:09,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:40:09,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:40:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:40:09,210 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-21 15:40:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:09,375 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2021-12-21 15:40:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:40:09,376 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-21 15:40:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:09,382 INFO L225 Difference]: With dead ends: 2194 [2021-12-21 15:40:09,382 INFO L226 Difference]: Without dead ends: 1139 [2021-12-21 15:40:09,384 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-21 15:40:09,384 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-21 15:40:09,385 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-21 15:40:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-21 15:40:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2021-12-21 15:40:09,457 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-21 15:40:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2021-12-21 15:40:09,460 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2021-12-21 15:40:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:09,460 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2021-12-21 15:40:09,460 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-21 15:40:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2021-12-21 15:40:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-21 15:40:09,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:09,462 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-21 15:40:09,496 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-21 15:40:09,687 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-21 15:40:09,687 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2021-12-21 15:40:09,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:09,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893635978] [2021-12-21 15:40:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:09,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 15:40:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-21 15:40:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-21 15:40:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:09,953 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-21 15:40:09,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893635978] [2021-12-21 15:40:09,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893635978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132262093] [2021-12-21 15:40:09,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 15:40:09,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:09,960 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-21 15:40:09,961 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-21 15:40:10,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 15:40:10,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:40:10,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:40:10,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:10,843 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-21 15:40:10,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:10,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132262093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:10,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:10,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-21 15:40:10,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728340853] [2021-12-21 15:40:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:10,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:40:10,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:10,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:40:10,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:40:10,846 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-21 15:40:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:10,903 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2021-12-21 15:40:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:40:10,904 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-21 15:40:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:10,908 INFO L225 Difference]: With dead ends: 1765 [2021-12-21 15:40:10,908 INFO L226 Difference]: Without dead ends: 717 [2021-12-21 15:40:10,910 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-21 15:40:10,910 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-21 15:40:10,911 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-21 15:40:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-21 15:40:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2021-12-21 15:40:10,961 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-21 15:40:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2021-12-21 15:40:10,964 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2021-12-21 15:40:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:10,964 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2021-12-21 15:40:10,965 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-21 15:40:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2021-12-21 15:40:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-21 15:40:10,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:10,967 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-21 15:40:10,996 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-21 15:40:11,191 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-21 15:40:11,191 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2021-12-21 15:40:11,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878308074] [2021-12-21 15:40:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:11,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-21 15:40:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-21 15:40:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-21 15:40:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:11,485 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-21 15:40:11,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878308074] [2021-12-21 15:40:11,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878308074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866889211] [2021-12-21 15:40:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:11,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:11,488 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-21 15:40:11,494 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-21 15:40:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:12,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 15:40:12,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:12,470 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-21 15:40:12,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:12,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866889211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:12,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:12,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-21 15:40:12,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070140752] [2021-12-21 15:40:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:12,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:40:12,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:40:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-21 15:40:12,472 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-21 15:40:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:12,749 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2021-12-21 15:40:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:40:12,750 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-21 15:40:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:12,753 INFO L225 Difference]: With dead ends: 1338 [2021-12-21 15:40:12,753 INFO L226 Difference]: Without dead ends: 653 [2021-12-21 15:40:12,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-21 15:40:12,755 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 15:40:12,755 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-21 15:40:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-12-21 15:40:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2021-12-21 15:40:12,794 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-21 15:40:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2021-12-21 15:40:12,796 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2021-12-21 15:40:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:12,797 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2021-12-21 15:40:12,797 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-21 15:40:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2021-12-21 15:40:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-21 15:40:12,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:12,798 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-21 15:40:12,830 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-21 15:40:13,011 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-21 15:40:13,011 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2021-12-21 15:40:13,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629573825] [2021-12-21 15:40:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:13,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-21 15:40:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-21 15:40:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-21 15:40:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:13,296 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-21 15:40:13,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:13,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629573825] [2021-12-21 15:40:13,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629573825] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:13,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587830466] [2021-12-21 15:40:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:13,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:13,298 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-21 15:40:13,300 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-21 15:40:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-21 15:40:14,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:14,346 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-21 15:40:14,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:14,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587830466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:14,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:14,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2021-12-21 15:40:14,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211410268] [2021-12-21 15:40:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:14,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:40:14,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:40:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-21 15:40:14,348 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-21 15:40:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:14,511 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2021-12-21 15:40:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:40:14,512 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-21 15:40:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:14,515 INFO L225 Difference]: With dead ends: 1241 [2021-12-21 15:40:14,515 INFO L226 Difference]: Without dead ends: 673 [2021-12-21 15:40:14,516 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-21 15:40:14,517 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 35 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:40:14,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1743 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:40:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-12-21 15:40:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2021-12-21 15:40:14,560 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-21 15:40:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2021-12-21 15:40:14,562 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2021-12-21 15:40:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:14,562 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2021-12-21 15:40:14,562 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-21 15:40:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2021-12-21 15:40:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-21 15:40:14,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:14,564 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-21 15:40:14,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-21 15:40:14,778 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-21 15:40:14,778 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2021-12-21 15:40:14,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:14,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723192111] [2021-12-21 15:40:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:14,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-21 15:40:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-21 15:40:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-21 15:40:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:15,041 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-21 15:40:15,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:15,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723192111] [2021-12-21 15:40:15,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723192111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:15,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434067432] [2021-12-21 15:40:15,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 15:40:15,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:15,044 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-21 15:40:15,069 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-21 15:40:15,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 15:40:15,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:40:15,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 15:40:15,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:16,009 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-21 15:40:16,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:16,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434067432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:16,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:16,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-21 15:40:16,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726124834] [2021-12-21 15:40:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:16,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:40:16,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:40:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:40:16,011 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-21 15:40:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:16,030 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2021-12-21 15:40:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:40:16,030 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-21 15:40:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:16,032 INFO L225 Difference]: With dead ends: 660 [2021-12-21 15:40:16,032 INFO L226 Difference]: Without dead ends: 259 [2021-12-21 15:40:16,035 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-21 15:40:16,035 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-21 15:40:16,036 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-21 15:40:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-21 15:40:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2021-12-21 15:40:16,051 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-21 15:40:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2021-12-21 15:40:16,052 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2021-12-21 15:40:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:16,053 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2021-12-21 15:40:16,053 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-21 15:40:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2021-12-21 15:40:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-12-21 15:40:16,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:40:16,055 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-21 15:40:16,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-21 15:40:16,272 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-21 15:40:16,272 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:40:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:40:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2021-12-21 15:40:16,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:40:16,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725155908] [2021-12-21 15:40:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:16,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:40:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 15:40:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 15:40:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:40:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 15:40:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:40:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-21 15:40:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 15:40:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 15:40:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 15:40:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 15:40:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 15:40:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-21 15:40:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-21 15:40:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-21 15:40:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-21 15:40:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:40:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:16,551 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-21 15:40:16,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:40:16,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725155908] [2021-12-21 15:40:16,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725155908] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:40:16,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579395984] [2021-12-21 15:40:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:40:16,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:40:16,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:40:16,553 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-21 15:40:16,580 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-21 15:40:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:40:17,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 15:40:17,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:40:17,656 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-21 15:40:17,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:40:17,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579395984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:40:17,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:40:17,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-21 15:40:17,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716793902] [2021-12-21 15:40:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:40:17,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:40:17,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:40:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:40:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-21 15:40:17,658 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-21 15:40:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:40:17,706 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2021-12-21 15:40:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:40:17,707 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-21 15:40:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:40:17,707 INFO L225 Difference]: With dead ends: 251 [2021-12-21 15:40:17,707 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 15:40:17,708 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-21 15:40:17,708 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-21 15:40:17,708 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-21 15:40:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 15:40:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 15:40:17,709 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-21 15:40:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 15:40:17,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2021-12-21 15:40:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:40:17,710 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 15:40:17,710 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-21 15:40:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 15:40:17,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 15:40:17,712 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 15:40:17,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-21 15:40:17,913 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-21 15:40:17,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-21 15:40:26,305 WARN L227 SmtUtils]: Spent 6.62s 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-21 15:40:34,019 WARN L227 SmtUtils]: Spent 6.34s 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-21 15:40:43,818 INFO L861 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2021-12-21 15:40:43,818 INFO L858 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2021-12-21 15:40:43,818 INFO L861 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2021-12-21 15:40:43,818 INFO L861 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2021-12-21 15:40:43,818 INFO L861 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2021-12-21 15:40:43,818 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-12-21 15:40:43,819 INFO L858 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2021-12-21 15:40:43,819 INFO L858 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2021-12-21 15:40:43,819 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2021-12-21 15:40:43,819 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-21 15:40:43,819 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-21 15:40:43,819 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2021-12-21 15:40:43,819 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2021-12-21 15:40:43,820 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-21 15:40:43,820 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2021-12-21 15:40:43,820 INFO L858 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2021-12-21 15:40:43,820 INFO L861 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2021-12-21 15:40:43,820 INFO L861 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2021-12-21 15:40:43,820 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2021-12-21 15:40:43,820 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2021-12-21 15:40:43,821 INFO L858 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2021-12-21 15:40:43,821 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2021-12-21 15:40:43,821 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-21 15:40:43,821 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2021-12-21 15:40:43,821 INFO L861 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2021-12-21 15:40:43,821 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-12-21 15:40:43,821 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-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2021-12-21 15:40:43,822 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-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-12-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-12-21 15:40:43,822 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-21 15:40:43,822 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-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2021-12-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2021-12-21 15:40:43,822 INFO L861 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2021-12-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2021-12-21 15:40:43,822 INFO L858 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2021-12-21 15:40:43,822 INFO L861 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2021-12-21 15:40:43,823 INFO L861 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2021-12-21 15:40:43,823 INFO L858 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2021-12-21 15:40:43,823 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-21 15:40:43,823 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-12-21 15:40:43,823 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2021-12-21 15:40:43,823 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2021-12-21 15:40:43,824 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-21 15:40:43,824 INFO L858 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2021-12-21 15:40:43,824 INFO L861 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2021-12-21 15:40:43,824 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2021-12-21 15:40:43,824 INFO L861 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2021-12-21 15:40:43,824 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-21 15:40:43,824 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2021-12-21 15:40:43,825 INFO L861 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2021-12-21 15:40:43,825 INFO L858 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2021-12-21 15:40:43,825 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-21 15:40:43,825 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-21 15:40:43,825 INFO L858 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2021-12-21 15:40:43,825 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-21 15:40:43,825 INFO L858 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2021-12-21 15:40:43,826 INFO L861 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2021-12-21 15:40:43,826 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-12-21 15:40:43,826 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-21 15:40:43,826 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-12-21 15:40:43,826 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-12-21 15:40:43,826 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-21 15:40:43,826 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-12-21 15:40:43,826 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-21 15:40:43,827 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-21 15:40:43,827 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-21 15:40:43,827 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-12-21 15:40:43,827 INFO L858 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2021-12-21 15:40:43,827 INFO L858 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2021-12-21 15:40:43,827 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-21 15:40:43,827 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-12-21 15:40:43,828 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-21 15:40:43,828 INFO L858 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2021-12-21 15:40:43,828 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-21 15:40:43,828 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-12-21 15:40:43,828 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-12-21 15:40:43,828 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-12-21 15:40:43,828 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-21 15:40:43,829 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-12-21 15:40:43,829 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-21 15:40:43,829 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-21 15:40:43,829 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-12-21 15:40:43,829 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-12-21 15:40:43,829 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-21 15:40:43,829 INFO L858 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-12-21 15:40:43,830 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-12-21 15:40:43,830 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-21 15:40:43,831 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-21 15:40:43,831 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-21 15:40:43,831 INFO L858 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2021-12-21 15:40:43,831 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-21 15:40:43,831 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-21 15:40:43,831 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-21 15:40:43,832 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-21 15:40:43,832 INFO L858 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2021-12-21 15:40:43,832 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-21 15:40:43,832 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-21 15:40:43,832 INFO L858 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2021-12-21 15:40:43,832 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-21 15:40:43,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-21 15:40:43,832 INFO L858 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2021-12-21 15:40:43,833 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-21 15:40:43,833 INFO L854 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2021-12-21 15:40:43,833 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-21 15:40:43,833 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-21 15:40:43,833 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-21 15:40:43,833 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-21 15:40:43,834 INFO L858 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2021-12-21 15:40:43,834 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-21 15:40:43,834 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-21 15:40:43,834 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-12-21 15:40:43,834 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-21 15:40:43,834 INFO L858 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2021-12-21 15:40:43,834 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-21 15:40:43,835 INFO L858 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2021-12-21 15:40:43,835 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-21 15:40:43,835 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-21 15:40:43,835 INFO L858 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2021-12-21 15:40:43,835 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-21 15:40:43,835 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-21 15:40:43,835 INFO L858 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2021-12-21 15:40:43,836 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-21 15:40:43,836 INFO L858 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2021-12-21 15:40:43,836 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-21 15:40:43,836 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-21 15:40:43,836 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-21 15:40:43,836 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-12-21 15:40:43,836 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-12-21 15:40:43,836 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-12-21 15:40:43,836 INFO L854 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-21 15:40:43,836 INFO L854 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2021-12-21 15:40:43,836 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-21 15:40:43,836 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-21 15:40:43,837 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-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-12-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-21 15:40:43,837 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-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2021-12-21 15:40:43,837 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-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-12-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2021-12-21 15:40:43,837 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-21 15:40:43,837 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-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-12-21 15:40:43,837 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-21 15:40:43,837 INFO L858 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2021-12-21 15:40:43,837 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-21 15:40:43,838 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-21 15:40:43,838 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-21 15:40:43,838 INFO L861 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2021-12-21 15:40:43,838 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2021-12-21 15:40:43,838 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2021-12-21 15:40:43,838 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-12-21 15:40:43,838 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2021-12-21 15:40:43,839 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2021-12-21 15:40:43,839 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2021-12-21 15:40:43,841 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-21 15:40:43,842 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:40:43,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:43,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:43,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:40:43 BoogieIcfgContainer [2021-12-21 15:40:43,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:40:43,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:40:43,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:40:43,875 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:40:43,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:39:47" (3/4) ... [2021-12-21 15:40:43,878 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2021-12-21 15:40:43,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2021-12-21 15:40:43,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-12-21 15:40:43,896 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-12-21 15:40:43,897 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-12-21 15:40:43,898 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-21 15:40:43,899 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-21 15:40:43,900 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-21 15:40:43,921 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-21 15:40:43,921 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-21 15:40:43,921 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-21 15:40:43,922 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-21 15:40:43,922 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-21 15:40:43,922 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-21 15:40:43,923 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-21 15:40:43,923 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-21 15:40:43,924 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-21 15:40:43,924 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-21 15:40:43,924 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-21 15:40:43,925 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-21 15:40:43,925 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-21 15:40:43,925 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-21 15:40:43,926 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-21 15:40:43,926 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-21 15:40:43,926 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-21 15:40:43,926 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-21 15:40:44,047 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:40:44,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:40:44,048 INFO L158 Benchmark]: Toolchain (without parser) took 58528.35ms. Allocated memory was 96.5MB in the beginning and 736.1MB in the end (delta: 639.6MB). Free memory was 60.8MB in the beginning and 339.6MB in the end (delta: -278.8MB). Peak memory consumption was 360.8MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,048 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:40:44,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 895.20ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 46.6MB in the end (delta: 14.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.58ms. Allocated memory is still 96.5MB. Free memory was 46.6MB in the beginning and 41.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,049 INFO L158 Benchmark]: Boogie Preprocessor took 95.93ms. Allocated memory is still 96.5MB. Free memory was 41.5MB in the beginning and 59.7MB in the end (delta: -18.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,049 INFO L158 Benchmark]: RCFGBuilder took 1063.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 59.7MB in the beginning and 84.7MB in the end (delta: -25.0MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,049 INFO L158 Benchmark]: TraceAbstraction took 56202.98ms. Allocated memory was 127.9MB in the beginning and 736.1MB in the end (delta: 608.2MB). Free memory was 84.3MB in the beginning and 401.5MB in the end (delta: -317.2MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,050 INFO L158 Benchmark]: Witness Printer took 172.77ms. Allocated memory is still 736.1MB. Free memory was 401.5MB in the beginning and 339.6MB in the end (delta: 61.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2021-12-21 15:40:44,051 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 79.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 895.20ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 46.6MB in the end (delta: 14.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.58ms. Allocated memory is still 96.5MB. Free memory was 46.6MB in the beginning and 41.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.93ms. Allocated memory is still 96.5MB. Free memory was 41.5MB in the beginning and 59.7MB in the end (delta: -18.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 59.7MB in the beginning and 84.7MB in the end (delta: -25.0MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * TraceAbstraction took 56202.98ms. Allocated memory was 127.9MB in the beginning and 736.1MB in the end (delta: 608.2MB). Free memory was 84.3MB in the beginning and 401.5MB in the end (delta: -317.2MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. * Witness Printer took 172.77ms. Allocated memory is still 736.1MB. Free memory was 401.5MB in the beginning and 339.6MB in the end (delta: 61.9MB). 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: 56.1s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2904 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 19924 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14910 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 5014 mSDtfsCounter, 1841 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, 3.2s 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: 1.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377649 FormulaSimplificationTreeSizeReduction, 16.4s HoareSimplificationTime, 81 FomulaSimplificationsInter, 268966 FormulaSimplificationTreeSizeReductionInter, 9.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 9.9s 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-21 15:40:44,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:44,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,060 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-21 15:40:44,062 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,063 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:44,063 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,063 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-21 15:40:44,064 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,064 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:44,064 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,064 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:44,065 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,065 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 15:40:44,065 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:40:44,065 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-21 15:40:44,111 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