./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:57:18,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:57:18,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:57:18,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:57:18,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:57:18,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:57:18,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:57:18,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:57:18,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:57:18,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:57:18,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:57:18,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:57:18,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:57:18,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:57:18,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:57:18,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:57:18,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:57:18,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:57:18,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:57:18,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:57:18,239 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:57:18,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:57:18,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:57:18,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:57:18,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:57:18,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:57:18,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:57:18,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:57:18,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:57:18,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:57:18,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:57:18,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:57:18,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:57:18,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:57:18,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:57:18,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:57:18,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:57:18,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:57:18,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:57:18,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:57:18,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:57:18,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:57:18,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:57:18,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:57:18,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:57:18,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:57:18,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:57:18,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:57:18,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:57:18,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:57:18,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:57:18,284 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:57:18,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:57:18,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:57:18,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:57:18,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:18,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:57:18,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:57:18,286 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 -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2022-07-21 09:57:18,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:57:18,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:57:18,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:57:18,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:57:18,566 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:57:18,567 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-usb-serial-ir-usb.ko.cil.out.i [2022-07-21 09:57:18,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c4f9e3a/3e0221da7bbc4b7c96a05e15ad296986/FLAG8e4450a01 [2022-07-21 09:57:19,194 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:57:19,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-07-21 09:57:19,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c4f9e3a/3e0221da7bbc4b7c96a05e15ad296986/FLAG8e4450a01 [2022-07-21 09:57:19,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c4f9e3a/3e0221da7bbc4b7c96a05e15ad296986 [2022-07-21 09:57:19,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:57:19,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:57:19,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:19,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:57:19,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:57:19,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:19" (1/1) ... [2022-07-21 09:57:19,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e18b4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:19, skipping insertion in model container [2022-07-21 09:57:19,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:19" (1/1) ... [2022-07-21 09:57:19,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:57:19,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:57:20,087 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-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-07-21 09:57:20,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:20,149 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:57:20,298 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-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-07-21 09:57:20,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:20,348 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:57:20,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20 WrapperNode [2022-07-21 09:57:20,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:20,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:20,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:57:20,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:57:20,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,487 INFO L137 Inliner]: procedures = 81, calls = 494, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 1672 [2022-07-21 09:57:20,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:20,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:57:20,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:57:20,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:57:20,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:57:20,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:57:20,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:57:20,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:57:20,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (1/1) ... [2022-07-21 09:57:20,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:20,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 09:57:20,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 09:57:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:57:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2022-07-21 09:57:20,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2022-07-21 09:57:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:57:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2022-07-21 09:57:20,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:57:20,693 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:57:20,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:57:20,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:57:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:57:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:57:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-07-21 09:57:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-07-21 09:57:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:57:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:57:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 09:57:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 09:57:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2022-07-21 09:57:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2022-07-21 09:57:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:57:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:57:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-07-21 09:57:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-07-21 09:57:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:57:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:57:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:57:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:57:20,958 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:57:20,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:57:20,963 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:57:21,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-07-21 09:57:21,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-07-21 09:57:21,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:57:21,162 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:57:21,168 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:57:21,181 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:57:21,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume !false; [2022-07-21 09:57:21,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##73: assume false; [2022-07-21 09:57:21,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-07-21 09:57:21,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-07-21 09:57:21,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-21 09:57:21,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-21 09:57:21,799 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:57:21,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:57:21,805 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-07-21 09:57:21,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:21 BoogieIcfgContainer [2022-07-21 09:57:21,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:57:21,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:57:21,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:57:21,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:57:21,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:57:19" (1/3) ... [2022-07-21 09:57:21,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782fc527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:57:21, skipping insertion in model container [2022-07-21 09:57:21,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:20" (2/3) ... [2022-07-21 09:57:21,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782fc527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:57:21, skipping insertion in model container [2022-07-21 09:57:21,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:21" (3/3) ... [2022-07-21 09:57:21,811 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-07-21 09:57:21,820 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:57:21,820 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:57:21,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:57:21,858 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@768373fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c3382dc [2022-07-21 09:57:21,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:57:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 09:57:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 09:57:21,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:21,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:21,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -248243768, now seen corresponding path program 1 times [2022-07-21 09:57:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:21,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394027093] [2022-07-21 09:57:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:57:22,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:22,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394027093] [2022-07-21 09:57:22,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394027093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:22,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:22,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:57:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158587558] [2022-07-21 09:57:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:22,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:57:22,408 INFO L87 Difference]: Start difference. First operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 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) [2022-07-21 09:57:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:23,109 INFO L93 Difference]: Finished difference Result 845 states and 1261 transitions. [2022-07-21 09:57:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:57:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 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 [2022-07-21 09:57:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:23,129 INFO L225 Difference]: With dead ends: 845 [2022-07-21 09:57:23,130 INFO L226 Difference]: Without dead ends: 538 [2022-07-21 09:57:23,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:23,135 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 460 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:23,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1269 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:57:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-21 09:57:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2022-07-21 09:57:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3411513859275053) internal successors, (629), 478 states have internal predecessors, (629), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 09:57:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 702 transitions. [2022-07-21 09:57:23,186 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 702 transitions. Word has length 18 [2022-07-21 09:57:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:23,186 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 702 transitions. [2022-07-21 09:57:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 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) [2022-07-21 09:57:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 702 transitions. [2022-07-21 09:57:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 09:57:23,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:23,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:23,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:57:23,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -835049782, now seen corresponding path program 1 times [2022-07-21 09:57:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:23,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091430676] [2022-07-21 09:57:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:57:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:23,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091430676] [2022-07-21 09:57:23,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091430676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:23,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:23,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:57:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358244029] [2022-07-21 09:57:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:23,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:57:23,311 INFO L87 Difference]: Start difference. First operand 528 states and 702 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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) [2022-07-21 09:57:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:23,693 INFO L93 Difference]: Finished difference Result 1543 states and 2060 transitions. [2022-07-21 09:57:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:57:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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 [2022-07-21 09:57:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:23,697 INFO L225 Difference]: With dead ends: 1543 [2022-07-21 09:57:23,698 INFO L226 Difference]: Without dead ends: 1033 [2022-07-21 09:57:23,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:57:23,700 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 470 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:23,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 906 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:57:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-07-21 09:57:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1020. [2022-07-21 09:57:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 913 states have (on average 1.343921139101862) internal successors, (1227), 926 states have internal predecessors, (1227), 69 states have call successors, (69), 38 states have call predecessors, (69), 37 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-21 09:57:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1362 transitions. [2022-07-21 09:57:23,739 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1362 transitions. Word has length 18 [2022-07-21 09:57:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:23,740 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1362 transitions. [2022-07-21 09:57:23,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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) [2022-07-21 09:57:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1362 transitions. [2022-07-21 09:57:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 09:57:23,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:23,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:57:23,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -116851219, now seen corresponding path program 1 times [2022-07-21 09:57:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:23,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840860933] [2022-07-21 09:57:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:57:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840860933] [2022-07-21 09:57:23,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840860933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:23,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:23,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:57:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314253752] [2022-07-21 09:57:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:23,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:57:23,856 INFO L87 Difference]: Start difference. First operand 1020 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 09:57:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:24,111 INFO L93 Difference]: Finished difference Result 1022 states and 1363 transitions. [2022-07-21 09:57:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:57:24,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-07-21 09:57:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:24,127 INFO L225 Difference]: With dead ends: 1022 [2022-07-21 09:57:24,127 INFO L226 Difference]: Without dead ends: 1001 [2022-07-21 09:57:24,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:57:24,129 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 421 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:24,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 593 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:57:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-21 09:57:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2022-07-21 09:57:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3414634146341464) internal successors, (1210), 912 states have internal predecessors, (1210), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-07-21 09:57:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1336 transitions. [2022-07-21 09:57:24,159 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1336 transitions. Word has length 19 [2022-07-21 09:57:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:24,159 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1336 transitions. [2022-07-21 09:57:24,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 09:57:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1336 transitions. [2022-07-21 09:57:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 09:57:24,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:24,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:57:24,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -470649452, now seen corresponding path program 1 times [2022-07-21 09:57:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939638831] [2022-07-21 09:57:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:57:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939638831] [2022-07-21 09:57:24,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939638831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:24,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:24,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:57:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140892492] [2022-07-21 09:57:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:57:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:57:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:57:24,335 INFO L87 Difference]: Start difference. First operand 1001 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:24,986 INFO L93 Difference]: Finished difference Result 2037 states and 2716 transitions. [2022-07-21 09:57:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-07-21 09:57:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:24,990 INFO L225 Difference]: With dead ends: 2037 [2022-07-21 09:57:24,991 INFO L226 Difference]: Without dead ends: 1057 [2022-07-21 09:57:24,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:57:24,993 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 573 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:24,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1439 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:57:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-07-21 09:57:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1001. [2022-07-21 09:57:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3392461197339247) internal successors, (1208), 912 states have internal predecessors, (1208), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-07-21 09:57:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1334 transitions. [2022-07-21 09:57:25,046 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1334 transitions. Word has length 76 [2022-07-21 09:57:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:25,047 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1334 transitions. [2022-07-21 09:57:25,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1334 transitions. [2022-07-21 09:57:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 09:57:25,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:25,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:25,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:57:25,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -26748778, now seen corresponding path program 1 times [2022-07-21 09:57:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:25,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033471004] [2022-07-21 09:57:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:57:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:25,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033471004] [2022-07-21 09:57:25,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033471004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:25,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:25,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:57:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778597154] [2022-07-21 09:57:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:57:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:25,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:57:25,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:57:25,209 INFO L87 Difference]: Start difference. First operand 1001 states and 1334 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:25,896 INFO L93 Difference]: Finished difference Result 2033 states and 2706 transitions. [2022-07-21 09:57:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:25,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-07-21 09:57:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:25,901 INFO L225 Difference]: With dead ends: 2033 [2022-07-21 09:57:25,901 INFO L226 Difference]: Without dead ends: 1053 [2022-07-21 09:57:25,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:57:25,904 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 564 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:25,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1442 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:57:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2022-07-21 09:57:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 997. [2022-07-21 09:57:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 900 states have (on average 1.3377777777777777) internal successors, (1204), 910 states have internal predecessors, (1204), 62 states have call successors, (62), 35 states have call predecessors, (62), 34 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-21 09:57:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1326 transitions. [2022-07-21 09:57:25,964 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1326 transitions. Word has length 76 [2022-07-21 09:57:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:25,965 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1326 transitions. [2022-07-21 09:57:25,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1326 transitions. [2022-07-21 09:57:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 09:57:25,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:25,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:25,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:57:25,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash -481270382, now seen corresponding path program 1 times [2022-07-21 09:57:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025924899] [2022-07-21 09:57:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:57:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:26,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025924899] [2022-07-21 09:57:26,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025924899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:26,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:26,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:57:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327915635] [2022-07-21 09:57:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:26,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:57:26,163 INFO L87 Difference]: Start difference. First operand 997 states and 1326 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:26,676 INFO L93 Difference]: Finished difference Result 2989 states and 4048 transitions. [2022-07-21 09:57:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:57:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2022-07-21 09:57:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:26,698 INFO L225 Difference]: With dead ends: 2989 [2022-07-21 09:57:26,699 INFO L226 Difference]: Without dead ends: 2013 [2022-07-21 09:57:26,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:26,701 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 654 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:26,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2755 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:57:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-07-21 09:57:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 973. [2022-07-21 09:57:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 885 states have (on average 1.335593220338983) internal successors, (1182), 891 states have internal predecessors, (1182), 55 states have call successors, (55), 33 states have call predecessors, (55), 32 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2022-07-21 09:57:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1290 transitions. [2022-07-21 09:57:26,755 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1290 transitions. Word has length 76 [2022-07-21 09:57:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:26,755 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1290 transitions. [2022-07-21 09:57:26,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1290 transitions. [2022-07-21 09:57:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 09:57:26,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:26,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:26,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:57:26,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1149604904, now seen corresponding path program 1 times [2022-07-21 09:57:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:26,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068744764] [2022-07-21 09:57:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:57:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068744764] [2022-07-21 09:57:26,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068744764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:26,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:26,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:57:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300805209] [2022-07-21 09:57:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:57:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:57:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:26,934 INFO L87 Difference]: Start difference. First operand 973 states and 1290 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:27,543 INFO L93 Difference]: Finished difference Result 2228 states and 3006 transitions. [2022-07-21 09:57:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:57:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-07-21 09:57:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:27,548 INFO L225 Difference]: With dead ends: 2228 [2022-07-21 09:57:27,549 INFO L226 Difference]: Without dead ends: 1727 [2022-07-21 09:57:27,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:27,550 INFO L413 NwaCegarLoop]: 634 mSDtfsCounter, 389 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:27,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3972 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-21 09:57:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1001. [2022-07-21 09:57:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 905 states have (on average 1.3281767955801105) internal successors, (1202), 911 states have internal predecessors, (1202), 55 states have call successors, (55), 33 states have call predecessors, (55), 40 states have return successors, (69), 60 states have call predecessors, (69), 53 states have call successors, (69) [2022-07-21 09:57:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1326 transitions. [2022-07-21 09:57:27,586 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1326 transitions. Word has length 73 [2022-07-21 09:57:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:27,587 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1326 transitions. [2022-07-21 09:57:27,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1326 transitions. [2022-07-21 09:57:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 09:57:27,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:27,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:27,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:57:27,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1404341449, now seen corresponding path program 1 times [2022-07-21 09:57:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:27,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358571457] [2022-07-21 09:57:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:57:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358571457] [2022-07-21 09:57:27,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358571457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:27,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:27,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 09:57:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70534226] [2022-07-21 09:57:27,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:27,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:57:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:57:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:57:27,734 INFO L87 Difference]: Start difference. First operand 1001 states and 1326 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:28,731 INFO L93 Difference]: Finished difference Result 2242 states and 3020 transitions. [2022-07-21 09:57:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:57:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-07-21 09:57:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:28,737 INFO L225 Difference]: With dead ends: 2242 [2022-07-21 09:57:28,738 INFO L226 Difference]: Without dead ends: 1727 [2022-07-21 09:57:28,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:57:28,739 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1004 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:28,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 5679 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 09:57:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-07-21 09:57:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1001. [2022-07-21 09:57:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 905 states have (on average 1.3259668508287292) internal successors, (1200), 911 states have internal predecessors, (1200), 55 states have call successors, (55), 33 states have call predecessors, (55), 40 states have return successors, (69), 60 states have call predecessors, (69), 53 states have call successors, (69) [2022-07-21 09:57:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1324 transitions. [2022-07-21 09:57:28,784 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1324 transitions. Word has length 73 [2022-07-21 09:57:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:28,784 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1324 transitions. [2022-07-21 09:57:28,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:57:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1324 transitions. [2022-07-21 09:57:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 09:57:28,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:28,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:28,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:57:28,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -264483951, now seen corresponding path program 1 times [2022-07-21 09:57:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137062992] [2022-07-21 09:57:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:57:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137062992] [2022-07-21 09:57:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137062992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:28,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:28,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:57:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304238904] [2022-07-21 09:57:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:28,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:28,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:57:28,943 INFO L87 Difference]: Start difference. First operand 1001 states and 1324 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:29,585 INFO L93 Difference]: Finished difference Result 1540 states and 2037 transitions. [2022-07-21 09:57:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:57:29,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-07-21 09:57:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:29,590 INFO L225 Difference]: With dead ends: 1540 [2022-07-21 09:57:29,590 INFO L226 Difference]: Without dead ends: 1537 [2022-07-21 09:57:29,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:57:29,593 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 980 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:29,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2270 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-07-21 09:57:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1499. [2022-07-21 09:57:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1356 states have (on average 1.3281710914454277) internal successors, (1801), 1366 states have internal predecessors, (1801), 83 states have call successors, (83), 48 states have call predecessors, (83), 59 states have return successors, (108), 91 states have call predecessors, (108), 81 states have call successors, (108) [2022-07-21 09:57:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1992 transitions. [2022-07-21 09:57:29,651 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1992 transitions. Word has length 76 [2022-07-21 09:57:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 1499 states and 1992 transitions. [2022-07-21 09:57:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 09:57:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1992 transitions. [2022-07-21 09:57:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 09:57:29,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:29,654 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:57:29,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash 299119202, now seen corresponding path program 1 times [2022-07-21 09:57:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:29,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252262134] [2022-07-21 09:57:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:57:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:57:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:57:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:29,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252262134] [2022-07-21 09:57:29,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252262134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:29,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:29,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794829361] [2022-07-21 09:57:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:29,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:29,848 INFO L87 Difference]: Start difference. First operand 1499 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:30,634 INFO L93 Difference]: Finished difference Result 4547 states and 6038 transitions. [2022-07-21 09:57:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2022-07-21 09:57:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:30,644 INFO L225 Difference]: With dead ends: 4547 [2022-07-21 09:57:30,645 INFO L226 Difference]: Without dead ends: 3057 [2022-07-21 09:57:30,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:30,649 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 805 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:30,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1940 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:57:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-07-21 09:57:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2928. [2022-07-21 09:57:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3344671201814058) internal successors, (3531), 2671 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3912 transitions. [2022-07-21 09:57:30,774 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3912 transitions. Word has length 93 [2022-07-21 09:57:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:30,774 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3912 transitions. [2022-07-21 09:57:30,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3912 transitions. [2022-07-21 09:57:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 09:57:30,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:30,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 09:57:30,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1102442664, now seen corresponding path program 1 times [2022-07-21 09:57:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:30,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368580921] [2022-07-21 09:57:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 09:57:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:57:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:57:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:31,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368580921] [2022-07-21 09:57:31,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368580921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:31,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:31,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72576991] [2022-07-21 09:57:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:31,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:31,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:31,004 INFO L87 Difference]: Start difference. First operand 2928 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:31,760 INFO L93 Difference]: Finished difference Result 5994 states and 7973 transitions. [2022-07-21 09:57:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2022-07-21 09:57:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:31,770 INFO L225 Difference]: With dead ends: 5994 [2022-07-21 09:57:31,771 INFO L226 Difference]: Without dead ends: 3075 [2022-07-21 09:57:31,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:31,776 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 804 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:31,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1940 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-07-21 09:57:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2931. [2022-07-21 09:57:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2649 states have (on average 1.332955832389581) internal successors, (3531), 2674 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3912 transitions. [2022-07-21 09:57:31,910 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 3912 transitions. Word has length 94 [2022-07-21 09:57:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 2931 states and 3912 transitions. [2022-07-21 09:57:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 3912 transitions. [2022-07-21 09:57:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 09:57:31,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:31,914 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:31,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 09:57:31,914 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1030544549, now seen corresponding path program 1 times [2022-07-21 09:57:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518091520] [2022-07-21 09:57:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:57:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:57:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:57:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:57:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:32,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:32,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518091520] [2022-07-21 09:57:32,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518091520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:32,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:32,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848776978] [2022-07-21 09:57:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:32,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:32,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:32,082 INFO L87 Difference]: Start difference. First operand 2931 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:32,798 INFO L93 Difference]: Finished difference Result 5994 states and 7967 transitions. [2022-07-21 09:57:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 95 [2022-07-21 09:57:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:32,807 INFO L225 Difference]: With dead ends: 5994 [2022-07-21 09:57:32,807 INFO L226 Difference]: Without dead ends: 3072 [2022-07-21 09:57:32,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:32,812 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 798 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:32,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1940 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-07-21 09:57:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2925. [2022-07-21 09:57:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2643 states have (on average 1.3325766174801361) internal successors, (3522), 2668 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3903 transitions. [2022-07-21 09:57:32,915 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3903 transitions. Word has length 95 [2022-07-21 09:57:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:32,916 INFO L495 AbstractCegarLoop]: Abstraction has 2925 states and 3903 transitions. [2022-07-21 09:57:32,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3903 transitions. [2022-07-21 09:57:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-21 09:57:32,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:32,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:32,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 09:57:32,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1961803849, now seen corresponding path program 1 times [2022-07-21 09:57:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:32,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522604809] [2022-07-21 09:57:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:57:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:57:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:57:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:57:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522604809] [2022-07-21 09:57:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522604809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:33,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:33,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:33,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465828042] [2022-07-21 09:57:33,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:33,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:33,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:33,099 INFO L87 Difference]: Start difference. First operand 2925 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:33,753 INFO L93 Difference]: Finished difference Result 5988 states and 7955 transitions. [2022-07-21 09:57:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 96 [2022-07-21 09:57:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:33,762 INFO L225 Difference]: With dead ends: 5988 [2022-07-21 09:57:33,763 INFO L226 Difference]: Without dead ends: 3072 [2022-07-21 09:57:33,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:33,768 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 800 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:33,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1940 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:57:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-07-21 09:57:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2928. [2022-07-21 09:57:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3310657596371882) internal successors, (3522), 2671 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3903 transitions. [2022-07-21 09:57:33,931 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3903 transitions. Word has length 96 [2022-07-21 09:57:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:33,931 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3903 transitions. [2022-07-21 09:57:33,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3903 transitions. [2022-07-21 09:57:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 09:57:33,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:33,934 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:33,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 09:57:33,935 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash -400625242, now seen corresponding path program 1 times [2022-07-21 09:57:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:33,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910811863] [2022-07-21 09:57:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:57:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:57:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 09:57:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:34,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:34,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910811863] [2022-07-21 09:57:34,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910811863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:34,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:34,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296221051] [2022-07-21 09:57:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:34,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:34,099 INFO L87 Difference]: Start difference. First operand 2928 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:34,882 INFO L93 Difference]: Finished difference Result 5988 states and 7949 transitions. [2022-07-21 09:57:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2022-07-21 09:57:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:34,892 INFO L225 Difference]: With dead ends: 5988 [2022-07-21 09:57:34,892 INFO L226 Difference]: Without dead ends: 3069 [2022-07-21 09:57:34,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:34,897 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 794 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:34,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1940 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-07-21 09:57:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2922. [2022-07-21 09:57:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2640 states have (on average 1.330681818181818) internal successors, (3513), 2665 states have internal predecessors, (3513), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3894 transitions. [2022-07-21 09:57:35,045 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3894 transitions. Word has length 97 [2022-07-21 09:57:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:35,045 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3894 transitions. [2022-07-21 09:57:35,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3894 transitions. [2022-07-21 09:57:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 09:57:35,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:35,049 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:35,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:57:35,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1958173396, now seen corresponding path program 1 times [2022-07-21 09:57:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:35,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641813229] [2022-07-21 09:57:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 09:57:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:57:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:35,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:35,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641813229] [2022-07-21 09:57:35,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641813229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:35,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:35,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482297627] [2022-07-21 09:57:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:35,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:35,212 INFO L87 Difference]: Start difference. First operand 2922 states and 3894 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:35,959 INFO L93 Difference]: Finished difference Result 5970 states and 7925 transitions. [2022-07-21 09:57:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 98 [2022-07-21 09:57:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:35,978 INFO L225 Difference]: With dead ends: 5970 [2022-07-21 09:57:35,978 INFO L226 Difference]: Without dead ends: 3057 [2022-07-21 09:57:35,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:35,984 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 787 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:35,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-07-21 09:57:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2919. [2022-07-21 09:57:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2637 states have (on average 1.329920364050057) internal successors, (3507), 2662 states have internal predecessors, (3507), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3888 transitions. [2022-07-21 09:57:36,094 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3888 transitions. Word has length 98 [2022-07-21 09:57:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:36,094 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 3888 transitions. [2022-07-21 09:57:36,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3888 transitions. [2022-07-21 09:57:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 09:57:36,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:36,097 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:36,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:57:36,097 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2000823641, now seen corresponding path program 1 times [2022-07-21 09:57:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:36,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767248165] [2022-07-21 09:57:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:57:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:57:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 09:57:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:36,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767248165] [2022-07-21 09:57:36,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767248165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:36,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:36,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143866634] [2022-07-21 09:57:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:36,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:36,256 INFO L87 Difference]: Start difference. First operand 2919 states and 3888 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:36,987 INFO L93 Difference]: Finished difference Result 5964 states and 7913 transitions. [2022-07-21 09:57:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 99 [2022-07-21 09:57:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:36,993 INFO L225 Difference]: With dead ends: 5964 [2022-07-21 09:57:36,994 INFO L226 Difference]: Without dead ends: 3054 [2022-07-21 09:57:36,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:36,998 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 785 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:36,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-07-21 09:57:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2916. [2022-07-21 09:57:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2634 states have (on average 1.3291571753986333) internal successors, (3501), 2659 states have internal predecessors, (3501), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3882 transitions. [2022-07-21 09:57:37,099 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3882 transitions. Word has length 99 [2022-07-21 09:57:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:37,099 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 3882 transitions. [2022-07-21 09:57:37,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3882 transitions. [2022-07-21 09:57:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 09:57:37,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:37,102 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:37,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 09:57:37,102 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1968688333, now seen corresponding path program 1 times [2022-07-21 09:57:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90018197] [2022-07-21 09:57:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:57:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:57:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:57:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:57:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:37,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90018197] [2022-07-21 09:57:37,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90018197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:37,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:37,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618087010] [2022-07-21 09:57:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:37,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:37,263 INFO L87 Difference]: Start difference. First operand 2916 states and 3882 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:38,083 INFO L93 Difference]: Finished difference Result 5958 states and 7901 transitions. [2022-07-21 09:57:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:38,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 100 [2022-07-21 09:57:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:38,089 INFO L225 Difference]: With dead ends: 5958 [2022-07-21 09:57:38,089 INFO L226 Difference]: Without dead ends: 3051 [2022-07-21 09:57:38,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:38,092 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 783 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:38,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:57:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-07-21 09:57:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2913. [2022-07-21 09:57:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2913 states, 2631 states have (on average 1.3283922462941846) internal successors, (3495), 2656 states have internal predecessors, (3495), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-07-21 09:57:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3876 transitions. [2022-07-21 09:57:38,202 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3876 transitions. Word has length 100 [2022-07-21 09:57:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:38,202 INFO L495 AbstractCegarLoop]: Abstraction has 2913 states and 3876 transitions. [2022-07-21 09:57:38,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3876 transitions. [2022-07-21 09:57:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 09:57:38,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:38,206 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:38,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 09:57:38,206 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1466210216, now seen corresponding path program 1 times [2022-07-21 09:57:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:38,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423499770] [2022-07-21 09:57:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:57:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:57:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:57:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:57:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:57:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:38,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423499770] [2022-07-21 09:57:38,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423499770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:38,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317226968] [2022-07-21 09:57:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:38,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:57:38,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:57:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:57:39,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 09:57:39,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:39,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317226968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:39,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:39,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-21 09:57:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334182384] [2022-07-21 09:57:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:39,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:57:39,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:57:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:57:39,128 INFO L87 Difference]: Start difference. First operand 2913 states and 3876 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 09:57:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:39,409 INFO L93 Difference]: Finished difference Result 5809 states and 7733 transitions. [2022-07-21 09:57:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:57:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2022-07-21 09:57:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:39,415 INFO L225 Difference]: With dead ends: 5809 [2022-07-21 09:57:39,415 INFO L226 Difference]: Without dead ends: 2908 [2022-07-21 09:57:39,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:57:39,419 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:39,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1877 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:57:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-07-21 09:57:39,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-07-21 09:57:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2628 states have (on average 1.3280060882800608) internal successors, (3490), 2652 states have internal predecessors, (3490), 159 states have call successors, (159), 90 states have call predecessors, (159), 120 states have return successors, (220), 177 states have call predecessors, (220), 157 states have call successors, (220) [2022-07-21 09:57:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3869 transitions. [2022-07-21 09:57:39,550 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3869 transitions. Word has length 101 [2022-07-21 09:57:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:39,550 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 3869 transitions. [2022-07-21 09:57:39,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 09:57:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3869 transitions. [2022-07-21 09:57:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 09:57:39,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:39,553 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:39,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:57:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 09:57:39,775 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1414387121, now seen corresponding path program 1 times [2022-07-21 09:57:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270947796] [2022-07-21 09:57:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:57:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:57:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:57:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:57:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270947796] [2022-07-21 09:57:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270947796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772208591] [2022-07-21 09:57:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:40,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:57:40,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:57:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:40,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:57:40,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:57:40,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:57:40,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772208591] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:40,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:40,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-07-21 09:57:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82837400] [2022-07-21 09:57:40,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:40,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 09:57:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:40,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 09:57:40,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2022-07-21 09:57:40,900 INFO L87 Difference]: Start difference. First operand 2908 states and 3869 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-21 09:57:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:43,128 INFO L93 Difference]: Finished difference Result 6365 states and 8552 transitions. [2022-07-21 09:57:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 09:57:43,128 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 103 [2022-07-21 09:57:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:43,135 INFO L225 Difference]: With dead ends: 6365 [2022-07-21 09:57:43,136 INFO L226 Difference]: Without dead ends: 3473 [2022-07-21 09:57:43,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 09:57:43,141 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 2069 mSDsluCounter, 11038 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 11767 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:43,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 11767 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 09:57:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2022-07-21 09:57:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2033. [2022-07-21 09:57:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1822 states have (on average 1.3117453347969266) internal successors, (2390), 1837 states have internal predecessors, (2390), 121 states have call successors, (121), 76 states have call predecessors, (121), 89 states have return successors, (153), 127 states have call predecessors, (153), 119 states have call successors, (153) [2022-07-21 09:57:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2664 transitions. [2022-07-21 09:57:43,228 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2664 transitions. Word has length 103 [2022-07-21 09:57:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:43,229 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 2664 transitions. [2022-07-21 09:57:43,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-21 09:57:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2664 transitions. [2022-07-21 09:57:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-21 09:57:43,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:43,231 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:57:43,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 09:57:43,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:43,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1722415670, now seen corresponding path program 1 times [2022-07-21 09:57:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304071091] [2022-07-21 09:57:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:57:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:57:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:57:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:57:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 09:57:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:43,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304071091] [2022-07-21 09:57:43,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304071091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:43,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:43,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:57:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256741073] [2022-07-21 09:57:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:43,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:57:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:57:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:43,653 INFO L87 Difference]: Start difference. First operand 2033 states and 2664 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:44,240 INFO L93 Difference]: Finished difference Result 2165 states and 2792 transitions. [2022-07-21 09:57:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:57:44,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 105 [2022-07-21 09:57:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:44,241 INFO L225 Difference]: With dead ends: 2165 [2022-07-21 09:57:44,241 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:57:44,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:57:44,244 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 594 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:44,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1627 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:57:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:57:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:57:44,245 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) [2022-07-21 09:57:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:57:44,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-07-21 09:57:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:44,246 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:57:44,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 09:57:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:57:44,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:57:44,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:57:44,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 09:57:44,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:58:14,255 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 09:58:32,909 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 09:59:07,622 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 09:59:13,098 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-21 09:59:40,646 INFO L895 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 1 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 255) 0))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-07-21 09:59:40,646 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,646 INFO L899 garLoopResultBuilder]: For program point ir_xbof_changeEXIT(lines 4065 4127) no Hoare annotation was computed. [2022-07-21 09:59:40,646 INFO L899 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,646 INFO L895 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-07-21 09:59:40,646 INFO L895 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= (+ |ir_xbof_change_#in~xbof___0| 254) 0) (<= 2 |ir_xbof_change_#in~xbof___0|))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-07-21 09:59:40,646 INFO L899 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (<= 24 |ir_xbof_change_#in~xbof___0|) (<= (+ 228 |ir_xbof_change_#in~xbof___0|) 0) (not (= ~ir_add_bof~0 0))) (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)))) [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (or (and (or (<= (+ |ir_xbof_change_#in~xbof___0| 253) 0) (<= 3 |ir_xbof_change_#in~xbof___0|)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point ir_xbof_changeFINAL(lines 4065 4127) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-07-21 09:59:40,647 INFO L902 garLoopResultBuilder]: At program point ir_xbof_changeENTRY(lines 4065 4127) the Hoare annotation is: true [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (or .cse0 .cse1 (<= 5 |ir_xbof_change_#in~xbof___0|) (not (= ~ir_add_bof~0 0)) (<= (+ |ir_xbof_change_#in~xbof___0| 250) 0)))) [2022-07-21 09:59:40,647 INFO L899 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 48 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 208) 0))) (not (= ~ldv_urb_state~0 0))) [2022-07-21 09:59:40,647 INFO L895 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point ir_initENTRY(lines 4614 4647) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point ir_initFINAL(lines 4614 4647) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (or (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point L4642(lines 4616 4646) the Hoare annotation is: (or (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point ir_initEXIT(lines 4614 4647) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5154 5156) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 5154 5156) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 5154 5156) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5097 5099) no Hoare annotation was computed. [2022-07-21 09:59:40,648 INFO L899 garLoopResultBuilder]: For program point L5098(line 5098) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5097 5099) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5097 5099) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperEXIT(lines 3729 3734) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L902 garLoopResultBuilder]: At program point __kfifo_uint_must_check_helperENTRY(lines 3729 3734) the Hoare annotation is: true [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperFINAL(lines 3729 3734) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L902 garLoopResultBuilder]: At program point L5021(line 5021) the Hoare annotation is: true [2022-07-21 09:59:40,649 INFO L895 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base))) [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5013 5042) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L895 garLoopResultBuilder]: At program point L5037(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (and (= ~ldv_urb_state~0 0) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base) (let ((.cse0 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* .cse1 18446744073709551616))) (<= (+ .cse1 1) 0))))) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-07-21 09:59:40,649 INFO L895 garLoopResultBuilder]: At program point L5029(line 5029) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point L5029-1(lines 5026 5031) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3723 3728) the Hoare annotation is: true [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3723 3728) no Hoare annotation was computed. [2022-07-21 09:59:40,649 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3723 3728) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5072 5076) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5072 5076) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L902 garLoopResultBuilder]: At program point L4655(line 4655) the Hoare annotation is: true [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point ir_exitFINAL(lines 4650 4659) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L902 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: true [2022-07-21 09:59:40,650 INFO L902 garLoopResultBuilder]: At program point ir_exitENTRY(lines 4650 4659) the Hoare annotation is: true [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point ir_exitEXIT(lines 4650 4659) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point usb_serial_deregisterEXIT(lines 5138 5140) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L902 garLoopResultBuilder]: At program point usb_serial_deregisterENTRY(lines 5138 5140) the Hoare annotation is: true [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point usb_serial_deregisterFINAL(lines 5138 5140) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4918 4924) the Hoare annotation is: true [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4918 4924) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L895 garLoopResultBuilder]: At program point kmallocENTRY(lines 3644 3653) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 3644 3653) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L895 garLoopResultBuilder]: At program point L5078(line 5078) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 3644 3653) no Hoare annotation was computed. [2022-07-21 09:59:40,650 INFO L899 garLoopResultBuilder]: For program point L5078-1(line 5078) no Hoare annotation was computed. [2022-07-21 09:59:40,651 INFO L902 garLoopResultBuilder]: At program point L5078-2(lines 5077 5079) the Hoare annotation is: true [2022-07-21 09:59:40,651 INFO L902 garLoopResultBuilder]: At program point L5056-1(lines 5044 5061) the Hoare annotation is: true [2022-07-21 09:59:40,651 INFO L899 garLoopResultBuilder]: For program point L5122-1(line 5122) no Hoare annotation was computed. [2022-07-21 09:59:40,651 INFO L899 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2022-07-21 09:59:40,651 INFO L895 garLoopResultBuilder]: At program point L5122-2(lines 5121 5123) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,651 INFO L895 garLoopResultBuilder]: At program point L5056(line 5056) the Hoare annotation is: false [2022-07-21 09:59:40,655 INFO L895 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,655 INFO L895 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,655 INFO L895 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,656 INFO L899 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,656 INFO L895 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,656 INFO L899 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2022-07-21 09:59:40,656 INFO L895 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,656 INFO L899 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,656 INFO L895 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,656 INFO L895 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,656 INFO L899 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2022-07-21 09:59:40,656 INFO L899 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2022-07-21 09:59:40,657 INFO L899 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2022-07-21 09:59:40,657 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,657 INFO L895 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,657 INFO L895 garLoopResultBuilder]: At program point L5092(lines 5091 5093) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,657 INFO L899 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2022-07-21 09:59:40,658 INFO L895 garLoopResultBuilder]: At program point L4993(line 4993) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,658 INFO L899 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2022-07-21 09:59:40,658 INFO L899 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,658 INFO L895 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,659 INFO L895 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2022-07-21 09:59:40,659 INFO L895 garLoopResultBuilder]: At program point L4598(line 4598) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,659 INFO L895 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L4268(line 4268) no Hoare annotation was computed. [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2022-07-21 09:59:40,659 INFO L899 garLoopResultBuilder]: For program point L4995(line 4995) no Hoare annotation was computed. [2022-07-21 09:59:40,660 INFO L895 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,660 INFO L895 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,660 INFO L899 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2022-07-21 09:59:40,660 INFO L899 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2022-07-21 09:59:40,660 INFO L899 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2022-07-21 09:59:40,660 INFO L899 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2022-07-21 09:59:40,660 INFO L895 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) (- 1)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2022-07-21 09:59:40,661 INFO L899 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2022-07-21 09:59:40,661 INFO L899 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,661 INFO L895 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,661 INFO L895 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,661 INFO L899 garLoopResultBuilder]: For program point L4369(line 4369) no Hoare annotation was computed. [2022-07-21 09:59:40,661 INFO L895 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,661 INFO L899 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2022-07-21 09:59:40,662 INFO L895 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,662 INFO L895 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,662 INFO L899 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2022-07-21 09:59:40,662 INFO L899 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2022-07-21 09:59:40,662 INFO L895 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,662 INFO L895 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,662 INFO L899 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2022-07-21 09:59:40,662 INFO L895 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,663 INFO L895 garLoopResultBuilder]: At program point L4900(lines 4811 4907) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,663 INFO L895 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,663 INFO L895 garLoopResultBuilder]: At program point L4603(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,663 INFO L899 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2022-07-21 09:59:40,663 INFO L899 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,663 INFO L899 garLoopResultBuilder]: For program point L4372-1(line 4372) no Hoare annotation was computed. [2022-07-21 09:59:40,663 INFO L895 garLoopResultBuilder]: At program point L4372(line 4372) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,663 INFO L899 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2022-07-21 09:59:40,664 INFO L899 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2022-07-21 09:59:40,665 INFO L899 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2022-07-21 09:59:40,665 INFO L895 garLoopResultBuilder]: At program point L4571(line 4571) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,665 INFO L899 garLoopResultBuilder]: For program point L4571-1(line 4571) no Hoare annotation was computed. [2022-07-21 09:59:40,665 INFO L895 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,665 INFO L895 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,666 INFO L899 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2022-07-21 09:59:40,666 INFO L895 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,666 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2022-07-21 09:59:40,666 INFO L895 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,666 INFO L899 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2022-07-21 09:59:40,666 INFO L899 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,666 INFO L895 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,666 INFO L895 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,666 INFO L899 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L4607(lines 4458 4611) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,667 INFO L899 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,667 INFO L899 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,667 INFO L899 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,667 INFO L895 garLoopResultBuilder]: At program point L4410(lines 4379 4412) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,668 INFO L895 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2022-07-21 09:59:40,668 INFO L895 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2022-07-21 09:59:40,668 INFO L902 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,668 INFO L899 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2022-07-21 09:59:40,669 INFO L895 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,669 INFO L899 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2022-07-21 09:59:40,669 INFO L895 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,669 INFO L899 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2022-07-21 09:59:40,669 INFO L899 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2022-07-21 09:59:40,669 INFO L895 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,669 INFO L895 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,669 INFO L895 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,669 INFO L899 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L895 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,670 INFO L899 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2022-07-21 09:59:40,670 INFO L895 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,670 INFO L895 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse4 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|))) (or (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 (not .cse2) (<= ~ldv_urb_state~0 1) (not .cse3) .cse4) (and .cse0 .cse2 .cse1 .cse3 (= ~ldv_urb_state~0 0) .cse4))) [2022-07-21 09:59:40,671 INFO L899 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L895 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,671 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2022-07-21 09:59:40,671 INFO L899 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2022-07-21 09:59:40,672 INFO L899 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,672 INFO L895 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,672 INFO L899 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2022-07-21 09:59:40,672 INFO L895 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,672 INFO L899 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2022-07-21 09:59:40,672 INFO L895 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,672 INFO L895 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,672 INFO L899 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L895 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L895 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2022-07-21 09:59:40,673 INFO L895 garLoopResultBuilder]: At program point L4583(line 4583) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,673 INFO L899 garLoopResultBuilder]: For program point L4583-1(line 4583) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L895 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,674 INFO L895 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,674 INFO L895 garLoopResultBuilder]: At program point L4815(line 4815) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) (- 1)) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2022-07-21 09:59:40,674 INFO L899 garLoopResultBuilder]: For program point L4815-1(line 4815) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L3659-1(line 3659) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L895 garLoopResultBuilder]: At program point L3659(line 3659) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,675 INFO L895 garLoopResultBuilder]: At program point L4551(line 4551) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L4551-1(line 4551) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L895 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L5047(lines 5047 5052) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2022-07-21 09:59:40,675 INFO L899 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L899 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L899 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L899 garLoopResultBuilder]: For program point L3991-1(line 3991) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L899 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L895 garLoopResultBuilder]: At program point L3991(line 3991) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,676 INFO L895 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,676 INFO L899 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2022-07-21 09:59:40,676 INFO L895 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,676 INFO L895 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L899 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L899 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,677 INFO L895 garLoopResultBuilder]: At program point L5050(line 5050) the Hoare annotation is: false [2022-07-21 09:59:40,678 INFO L895 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L5050-1(lines 5046 5060) no Hoare annotation was computed. [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2022-07-21 09:59:40,679 INFO L895 garLoopResultBuilder]: At program point L4555(line 4555) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L4555-1(line 4555) no Hoare annotation was computed. [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,679 INFO L895 garLoopResultBuilder]: At program point L4357-2(lines 4357 4367) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,679 INFO L899 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4060(line 4060) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L895 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L899 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,680 INFO L895 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-07-21 09:59:40,681 INFO L895 garLoopResultBuilder]: At program point L5085(lines 5084 5086) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,681 INFO L899 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2022-07-21 09:59:40,681 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,681 INFO L895 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,681 INFO L899 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2022-07-21 09:59:40,681 INFO L899 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2022-07-21 09:59:40,681 INFO L895 garLoopResultBuilder]: At program point L5119(lines 5118 5120) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,682 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:59:40,682 INFO L895 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,682 INFO L899 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2022-07-21 09:59:40,682 INFO L895 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,682 INFO L895 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,682 INFO L899 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2022-07-21 09:59:40,682 INFO L899 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2022-07-21 09:59:40,682 INFO L895 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,682 INFO L899 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L895 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L899 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2022-07-21 09:59:40,683 INFO L895 garLoopResultBuilder]: At program point L5122(line 5122) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-21 09:59:40,684 INFO L899 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2022-07-21 09:59:40,684 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4909 4914) the Hoare annotation is: true [2022-07-21 09:59:40,684 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4909 4914) no Hoare annotation was computed. [2022-07-21 09:59:40,684 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4909 4914) no Hoare annotation was computed. [2022-07-21 09:59:40,684 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2022-07-21 09:59:40,688 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:59:40,689 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:59:40,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,726 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:40,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:59:40 BoogieIcfgContainer [2022-07-21 09:59:40,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:59:40,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:59:40,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:59:40,752 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:59:40,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:21" (3/4) ... [2022-07-21 09:59:40,755 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_xbof_change [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_init [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __kfifo_uint_must_check_helper [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-21 09:59:40,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_exit [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_serial_deregister [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-21 09:59:40,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-21 09:59:40,779 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2022-07-21 09:59:40,781 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2022-07-21 09:59:40,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-07-21 09:59:40,785 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-21 09:59:40,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 09:59:40,787 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:59:40,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:59:40,789 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:59:40,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || ((ldv_urb_state == 0 && urb == urb) && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state)) [2022-07-21 09:59:40,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2022-07-21 09:59:40,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result [2022-07-21 09:59:40,817 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2022-07-21 09:59:40,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2022-07-21 09:59:40,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2022-07-21 09:59:40,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2022-07-21 09:59:40,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-07-21 09:59:40,819 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-07-21 09:59:40,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-07-21 09:59:40,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) [2022-07-21 09:59:40,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-07-21 09:59:40,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) [2022-07-21 09:59:40,821 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-07-21 09:59:40,821 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-07-21 09:59:40,822 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-07-21 09:59:40,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:59:40,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:59:40,964 INFO L158 Benchmark]: Toolchain (without parser) took 141501.70ms. Allocated memory was 60.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 29.3MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,964 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 28.0MB in the beginning and 28.0MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:59:40,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 885.95ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 36.4MB in the end (delta: -7.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.54ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 38.2MB in the end (delta: -1.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,965 INFO L158 Benchmark]: Boogie Preprocessor took 146.64ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 29.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,966 INFO L158 Benchmark]: RCFGBuilder took 1171.36ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 29.8MB in the beginning and 50.7MB in the end (delta: -20.9MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,966 INFO L158 Benchmark]: TraceAbstraction took 138943.84ms. Allocated memory was 119.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 50.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 711.1MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,966 INFO L158 Benchmark]: Witness Printer took 211.82ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-07-21 09:59:40,973 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 28.0MB in the beginning and 28.0MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 885.95ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 36.4MB in the end (delta: -7.3MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.54ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 38.2MB in the end (delta: -1.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.64ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 29.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1171.36ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 29.8MB in the beginning and 50.7MB in the end (delta: -20.9MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 138943.84ms. Allocated memory was 119.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 50.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 711.1MB. Max. memory is 16.1GB. * Witness Printer took 211.82ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 43.0MB). Peak memory consumption was 41.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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: 4912]: 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 14 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 138.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 116.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14862 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14536 mSDsluCounter, 51116 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42098 mSDsCounter, 2544 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11748 IncrementalHoareTripleChecker+Invalid, 14292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2544 mSolverCounterUnsat, 9018 mSDtfsCounter, 11748 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2931occurred in iteration=11, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 5230 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 5155 PreInvPairs, 6439 NumberOfFragments, 1704 HoareAnnotationTreeSize, 5155 FomulaSimplifications, 1501148 FormulaSimplificationTreeSizeReduction, 107.1s HoareSimplificationTime, 137 FomulaSimplificationsInter, 25956918 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1790 NumberOfCodeBlocks, 1790 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 4034 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4263 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 112/120 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: 4918]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) - InvariantResult [Line: 5131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2022-07-21 09:59:41,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4379]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5013]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || ((ldv_urb_state == 0 && urb == urb) && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state)) - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5118]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5084]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2022-07-21 09:59:41,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4992]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5135]: Loop Invariant [2022-07-21 09:59:41,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3689]: Loop Invariant [2022-07-21 09:59:41,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5146]: Loop Invariant [2022-07-21 09:59:41,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 09:59:41,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 09:59:41,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] == -1) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 RESULT: Ultimate proved your program to be correct! [2022-07-21 09:59:41,073 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