./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 9c1b5966 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 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9c1b596 [2021-10-30 23:57:33,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-30 23:57:33,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-30 23:57:33,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-30 23:57:33,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-30 23:57:33,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-30 23:57:33,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-30 23:57:34,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-30 23:57:34,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-30 23:57:34,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-30 23:57:34,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-30 23:57:34,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-30 23:57:34,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-30 23:57:34,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-30 23:57:34,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-30 23:57:34,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-30 23:57:34,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-30 23:57:34,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-30 23:57:34,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-30 23:57:34,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-30 23:57:34,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-30 23:57:34,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-30 23:57:34,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-30 23:57:34,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-30 23:57:34,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-30 23:57:34,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-30 23:57:34,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-30 23:57:34,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-30 23:57:34,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-30 23:57:34,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-30 23:57:34,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-30 23:57:34,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-30 23:57:34,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-30 23:57:34,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-30 23:57:34,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-30 23:57:34,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-30 23:57:34,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-30 23:57:34,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-30 23:57:34,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-30 23:57:34,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-30 23:57:34,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-30 23:57:34,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-30 23:57:34,063 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-30 23:57:34,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-30 23:57:34,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-30 23:57:34,064 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-30 23:57:34,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-30 23:57:34,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-30 23:57:34,065 INFO L138 SettingsManager]: * Use SBE=true [2021-10-30 23:57:34,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-30 23:57:34,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-30 23:57:34,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-30 23:57:34,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-30 23:57:34,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-30 23:57:34,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-30 23:57:34,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-30 23:57:34,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-30 23:57:34,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-30 23:57:34,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-30 23:57:34,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-30 23:57:34,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-30 23:57:34,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 23:57:34,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-30 23:57:34,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-30 23:57:34,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-30 23:57:34,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-30 23:57:34,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-30 23:57:34,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-30 23:57:34,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-30 23:57:34,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-30 23:57:34,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-30 23:57:34,069 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 [2021-10-30 23:57:34,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-30 23:57:34,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-30 23:57:34,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-30 23:57:34,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-30 23:57:34,299 INFO L275 PluginConnector]: CDTParser initialized [2021-10-30 23:57:34,300 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 [2021-10-30 23:57:34,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff3f7e5c/d0c8d617f54447568eb48e9df8d22ce4/FLAGbafdffe9a [2021-10-30 23:57:34,936 INFO L306 CDTParser]: Found 1 translation units. [2021-10-30 23:57:34,937 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 [2021-10-30 23:57:34,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff3f7e5c/d0c8d617f54447568eb48e9df8d22ce4/FLAGbafdffe9a [2021-10-30 23:57:35,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff3f7e5c/d0c8d617f54447568eb48e9df8d22ce4 [2021-10-30 23:57:35,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-30 23:57:35,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-30 23:57:35,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-30 23:57:35,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-30 23:57:35,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-30 23:57:35,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 11:57:35" (1/1) ... [2021-10-30 23:57:35,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbf11c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:35, skipping insertion in model container [2021-10-30 23:57:35,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 11:57:35" (1/1) ... [2021-10-30 23:57:35,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-30 23:57:35,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-30 23:57:35,920 WARN L228 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] [2021-10-30 23:57:35,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 23:57:35,997 INFO L203 MainTranslator]: Completed pre-run [2021-10-30 23:57:36,151 WARN L228 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] [2021-10-30 23:57:36,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 23:57:36,216 INFO L208 MainTranslator]: Completed translation [2021-10-30 23:57:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36 WrapperNode [2021-10-30 23:57:36,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-30 23:57:36,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-30 23:57:36,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-30 23:57:36,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-30 23:57:36,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-30 23:57:36,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-30 23:57:36,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-30 23:57:36,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-30 23:57:36,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-30 23:57:36,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-30 23:57:36,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-30 23:57:36,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-30 23:57:36,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (1/1) ... [2021-10-30 23:57:36,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 23:57:36,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:57:36,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-30 23:57:36,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-30 23:57:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-30 23:57:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-30 23:57:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-30 23:57:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-30 23:57:36,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-30 23:57:36,893 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-30 23:57:36,896 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-30 23:57:36,898 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-30 23:57:36,899 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-30 23:57:36,912 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##339: assume false; [2021-10-30 23:57:40,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume !false; [2021-10-30 23:57:40,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2021-10-30 23:57:40,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2021-10-30 23:57:40,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2021-10-30 23:57:40,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2021-10-30 23:57:40,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-30 23:57:40,652 INFO L299 CfgBuilder]: Removed 156 assume(true) statements. [2021-10-30 23:57:40,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:57:40 BoogieIcfgContainer [2021-10-30 23:57:40,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-30 23:57:40,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-30 23:57:40,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-30 23:57:40,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-30 23:57:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.10 11:57:35" (1/3) ... [2021-10-30 23:57:40,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7248932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 11:57:40, skipping insertion in model container [2021-10-30 23:57:40,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:57:36" (2/3) ... [2021-10-30 23:57:40,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7248932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 11:57:40, skipping insertion in model container [2021-10-30 23:57:40,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:57:40" (3/3) ... [2021-10-30 23:57:40,662 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-10-30 23:57:40,668 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-30 23:57:40,668 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-10-30 23:57:40,710 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-30 23:57:40,715 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-30 23:57:40,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-30 23:57:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-30 23:57:40,739 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:40,739 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:40,740 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 986721885, now seen corresponding path program 1 times [2021-10-30 23:57:40,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:40,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128301226] [2021-10-30 23:57:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:40,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:41,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:41,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128301226] [2021-10-30 23:57:41,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128301226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:41,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:41,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:41,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588798985] [2021-10-30 23:57:41,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:41,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:41,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:41,243 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 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) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:41,511 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-10-30 23:57:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:41,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-10-30 23:57:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:41,526 INFO L225 Difference]: With dead ends: 788 [2021-10-30 23:57:41,529 INFO L226 Difference]: Without dead ends: 502 [2021-10-30 23:57:41,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-10-30 23:57:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 272. [2021-10-30 23:57:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 271 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2021-10-30 23:57:41,582 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 12 [2021-10-30 23:57:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:41,583 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2021-10-30 23:57:41,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2021-10-30 23:57:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-30 23:57:41,584 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:41,584 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:41,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-30 23:57:41,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1666780255, now seen corresponding path program 1 times [2021-10-30 23:57:41,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:41,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654246781] [2021-10-30 23:57:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:41,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:41,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:41,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654246781] [2021-10-30 23:57:41,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654246781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:41,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:41,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-30 23:57:41,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055804841] [2021-10-30 23:57:41,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-30 23:57:41,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-30 23:57:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-30 23:57:41,748 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:41,783 INFO L93 Difference]: Finished difference Result 781 states and 1056 transitions. [2021-10-30 23:57:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-30 23:57:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2021-10-30 23:57:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:41,788 INFO L225 Difference]: With dead ends: 781 [2021-10-30 23:57:41,788 INFO L226 Difference]: Without dead ends: 523 [2021-10-30 23:57:41,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-30 23:57:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-10-30 23:57:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2021-10-30 23:57:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 515 states have (on average 1.3650485436893205) internal successors, (703), 518 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 703 transitions. [2021-10-30 23:57:41,833 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 703 transitions. Word has length 12 [2021-10-30 23:57:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:41,835 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 703 transitions. [2021-10-30 23:57:41,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 703 transitions. [2021-10-30 23:57:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-30 23:57:41,837 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:41,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:41,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-30 23:57:41,838 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 130579806, now seen corresponding path program 1 times [2021-10-30 23:57:41,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:41,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958722426] [2021-10-30 23:57:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:41,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:41,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:41,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958722426] [2021-10-30 23:57:41,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958722426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:41,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:41,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-30 23:57:41,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327800069] [2021-10-30 23:57:41,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-30 23:57:41,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-30 23:57:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-30 23:57:41,983 INFO L87 Difference]: Start difference. First operand 519 states and 703 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:41,993 INFO L93 Difference]: Finished difference Result 519 states and 703 transitions. [2021-10-30 23:57:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-30 23:57:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-10-30 23:57:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:41,996 INFO L225 Difference]: With dead ends: 519 [2021-10-30 23:57:41,996 INFO L226 Difference]: Without dead ends: 513 [2021-10-30 23:57:41,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-30 23:57:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-10-30 23:57:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-10-30 23:57:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 512 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 694 transitions. [2021-10-30 23:57:42,015 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 694 transitions. Word has length 13 [2021-10-30 23:57:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:42,016 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 694 transitions. [2021-10-30 23:57:42,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 694 transitions. [2021-10-30 23:57:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-30 23:57:42,022 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:42,022 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-30 23:57:42,023 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1133933506, now seen corresponding path program 1 times [2021-10-30 23:57:42,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:42,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999855032] [2021-10-30 23:57:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:42,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:42,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:42,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999855032] [2021-10-30 23:57:42,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999855032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:42,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:42,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:42,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321537729] [2021-10-30 23:57:42,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:42,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:42,181 INFO L87 Difference]: Start difference. First operand 513 states and 694 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:42,402 INFO L93 Difference]: Finished difference Result 1458 states and 1991 transitions. [2021-10-30 23:57:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2021-10-30 23:57:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:42,406 INFO L225 Difference]: With dead ends: 1458 [2021-10-30 23:57:42,407 INFO L226 Difference]: Without dead ends: 959 [2021-10-30 23:57:42,408 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-10-30 23:57:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2021-10-30 23:57:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 944 states have (on average 1.3781779661016949) internal successors, (1301), 946 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1301 transitions. [2021-10-30 23:57:42,440 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1301 transitions. Word has length 49 [2021-10-30 23:57:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:42,441 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1301 transitions. [2021-10-30 23:57:42,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1301 transitions. [2021-10-30 23:57:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-30 23:57:42,445 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:42,446 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:42,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-30 23:57:42,446 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1156565760, now seen corresponding path program 1 times [2021-10-30 23:57:42,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:42,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638962347] [2021-10-30 23:57:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:42,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:42,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:42,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638962347] [2021-10-30 23:57:42,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638962347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:42,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:42,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 23:57:42,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503576190] [2021-10-30 23:57:42,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 23:57:42,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 23:57:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:42,644 INFO L87 Difference]: Start difference. First operand 947 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:42,933 INFO L93 Difference]: Finished difference Result 5883 states and 8075 transitions. [2021-10-30 23:57:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-30 23:57:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) Word has length 49 [2021-10-30 23:57:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:42,977 INFO L225 Difference]: With dead ends: 5883 [2021-10-30 23:57:42,978 INFO L226 Difference]: Without dead ends: 5410 [2021-10-30 23:57:42,980 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-30 23:57:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-10-30 23:57:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 959. [2021-10-30 23:57:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 956 states have (on average 1.3734309623430963) internal successors, (1313), 958 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1313 transitions. [2021-10-30 23:57:43,067 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1313 transitions. Word has length 49 [2021-10-30 23:57:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:43,067 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 1313 transitions. [2021-10-30 23:57:43,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1313 transitions. [2021-10-30 23:57:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-30 23:57:43,071 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:43,071 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:43,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-30 23:57:43,072 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash 145448510, now seen corresponding path program 1 times [2021-10-30 23:57:43,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:43,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297738827] [2021-10-30 23:57:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:43,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:43,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:43,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297738827] [2021-10-30 23:57:43,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297738827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:43,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:43,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-30 23:57:43,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393606167] [2021-10-30 23:57:43,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-30 23:57:43,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-30 23:57:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-30 23:57:43,242 INFO L87 Difference]: Start difference. First operand 959 states and 1313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:43,800 INFO L93 Difference]: Finished difference Result 3721 states and 5095 transitions. [2021-10-30 23:57:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-30 23:57:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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) Word has length 49 [2021-10-30 23:57:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:43,812 INFO L225 Difference]: With dead ends: 3721 [2021-10-30 23:57:43,812 INFO L226 Difference]: Without dead ends: 2776 [2021-10-30 23:57:43,815 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-10-30 23:57:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-10-30 23:57:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 957. [2021-10-30 23:57:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 954 states have (on average 1.370020964360587) internal successors, (1307), 956 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1307 transitions. [2021-10-30 23:57:43,889 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1307 transitions. Word has length 49 [2021-10-30 23:57:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:43,890 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 1307 transitions. [2021-10-30 23:57:43,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1307 transitions. [2021-10-30 23:57:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-30 23:57:43,891 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:43,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:43,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-30 23:57:43,892 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1338025611, now seen corresponding path program 1 times [2021-10-30 23:57:43,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:43,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210154041] [2021-10-30 23:57:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:43,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:44,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:44,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210154041] [2021-10-30 23:57:44,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210154041] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:44,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:44,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-30 23:57:44,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300450297] [2021-10-30 23:57:44,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:44,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:44,048 INFO L87 Difference]: Start difference. First operand 957 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:44,249 INFO L93 Difference]: Finished difference Result 2709 states and 3722 transitions. [2021-10-30 23:57:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) Word has length 52 [2021-10-30 23:57:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:44,257 INFO L225 Difference]: With dead ends: 2709 [2021-10-30 23:57:44,257 INFO L226 Difference]: Without dead ends: 1766 [2021-10-30 23:57:44,259 INFO L786 BasicCegarLoop]: 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 [2021-10-30 23:57:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2021-10-30 23:57:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 929. [2021-10-30 23:57:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 926 states have (on average 1.3682505399568035) internal successors, (1267), 928 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1267 transitions. [2021-10-30 23:57:44,325 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1267 transitions. Word has length 52 [2021-10-30 23:57:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:44,326 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1267 transitions. [2021-10-30 23:57:44,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1267 transitions. [2021-10-30 23:57:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-30 23:57:44,327 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:44,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:44,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-30 23:57:44,328 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1261439541, now seen corresponding path program 1 times [2021-10-30 23:57:44,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:44,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644442691] [2021-10-30 23:57:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:44,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:44,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:44,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644442691] [2021-10-30 23:57:44,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644442691] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:44,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:44,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:44,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202330225] [2021-10-30 23:57:44,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:44,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:44,456 INFO L87 Difference]: Start difference. First operand 929 states and 1267 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:45,752 INFO L93 Difference]: Finished difference Result 1415 states and 1927 transitions. [2021-10-30 23:57:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) Word has length 52 [2021-10-30 23:57:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:45,758 INFO L225 Difference]: With dead ends: 1415 [2021-10-30 23:57:45,758 INFO L226 Difference]: Without dead ends: 1411 [2021-10-30 23:57:45,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-10-30 23:57:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1400. [2021-10-30 23:57:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1397 states have (on average 1.3686471009305654) internal successors, (1912), 1399 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1912 transitions. [2021-10-30 23:57:45,853 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1912 transitions. Word has length 52 [2021-10-30 23:57:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:45,853 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1912 transitions. [2021-10-30 23:57:45,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1912 transitions. [2021-10-30 23:57:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-30 23:57:45,854 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:45,855 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-30 23:57:45,855 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1042941183, now seen corresponding path program 1 times [2021-10-30 23:57:45,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:45,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669341328] [2021-10-30 23:57:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:45,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:46,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:46,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669341328] [2021-10-30 23:57:46,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669341328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:46,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:46,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:46,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459241477] [2021-10-30 23:57:46,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:46,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:46,011 INFO L87 Difference]: Start difference. First operand 1400 states and 1912 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:46,404 INFO L93 Difference]: Finished difference Result 6295 states and 8608 transitions. [2021-10-30 23:57:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 23:57:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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) Word has length 58 [2021-10-30 23:57:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:46,421 INFO L225 Difference]: With dead ends: 6295 [2021-10-30 23:57:46,421 INFO L226 Difference]: Without dead ends: 4909 [2021-10-30 23:57:46,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2021-10-30 23:57:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 2687. [2021-10-30 23:57:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2684 states have (on average 1.3628912071535022) internal successors, (3658), 2686 states have internal predecessors, (3658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3658 transitions. [2021-10-30 23:57:46,659 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3658 transitions. Word has length 58 [2021-10-30 23:57:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:46,659 INFO L470 AbstractCegarLoop]: Abstraction has 2687 states and 3658 transitions. [2021-10-30 23:57:46,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3658 transitions. [2021-10-30 23:57:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-30 23:57:46,661 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:46,661 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:46,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-30 23:57:46,662 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1699019577, now seen corresponding path program 1 times [2021-10-30 23:57:46,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:46,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991539206] [2021-10-30 23:57:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:46,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:46,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:46,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991539206] [2021-10-30 23:57:46,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991539206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:46,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:46,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:46,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243035832] [2021-10-30 23:57:46,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:46,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:46,788 INFO L87 Difference]: Start difference. First operand 2687 states and 3658 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:47,168 INFO L93 Difference]: Finished difference Result 5265 states and 7149 transitions. [2021-10-30 23:57:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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) Word has length 58 [2021-10-30 23:57:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:47,177 INFO L225 Difference]: With dead ends: 5265 [2021-10-30 23:57:47,177 INFO L226 Difference]: Without dead ends: 2592 [2021-10-30 23:57:47,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2021-10-30 23:57:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2573. [2021-10-30 23:57:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2570 states have (on average 1.3556420233463036) internal successors, (3484), 2572 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3484 transitions. [2021-10-30 23:57:47,353 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3484 transitions. Word has length 58 [2021-10-30 23:57:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:47,354 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 3484 transitions. [2021-10-30 23:57:47,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3484 transitions. [2021-10-30 23:57:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-30 23:57:47,355 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:47,356 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:47,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-30 23:57:47,356 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash 589140347, now seen corresponding path program 1 times [2021-10-30 23:57:47,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:47,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400299520] [2021-10-30 23:57:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:47,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:57:47,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:47,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400299520] [2021-10-30 23:57:47,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400299520] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:47,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:47,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-30 23:57:47,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000832022] [2021-10-30 23:57:47,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-30 23:57:47,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-30 23:57:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-30 23:57:47,546 INFO L87 Difference]: Start difference. First operand 2573 states and 3484 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:48,206 INFO L93 Difference]: Finished difference Result 4491 states and 6067 transitions. [2021-10-30 23:57:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-30 23:57:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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) Word has length 66 [2021-10-30 23:57:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:48,215 INFO L225 Difference]: With dead ends: 4491 [2021-10-30 23:57:48,216 INFO L226 Difference]: Without dead ends: 2728 [2021-10-30 23:57:48,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-10-30 23:57:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2021-10-30 23:57:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1777. [2021-10-30 23:57:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1774 states have (on average 1.342728297632469) internal successors, (2382), 1776 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2382 transitions. [2021-10-30 23:57:48,372 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2382 transitions. Word has length 66 [2021-10-30 23:57:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:48,372 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 2382 transitions. [2021-10-30 23:57:48,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2382 transitions. [2021-10-30 23:57:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-30 23:57:48,374 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:48,374 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:48,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-30 23:57:48,375 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1323881078, now seen corresponding path program 1 times [2021-10-30 23:57:48,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:48,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540838838] [2021-10-30 23:57:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:48,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-30 23:57:48,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:48,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540838838] [2021-10-30 23:57:48,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540838838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:48,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:48,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 23:57:48,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056954448] [2021-10-30 23:57:48,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 23:57:48,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 23:57:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:57:48,843 INFO L87 Difference]: Start difference. First operand 1777 states and 2382 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:49,046 INFO L93 Difference]: Finished difference Result 3542 states and 4750 transitions. [2021-10-30 23:57:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 23:57:49,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) Word has length 68 [2021-10-30 23:57:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:49,052 INFO L225 Difference]: With dead ends: 3542 [2021-10-30 23:57:49,053 INFO L226 Difference]: Without dead ends: 1775 [2021-10-30 23:57:49,055 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-30 23:57:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-10-30 23:57:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2021-10-30 23:57:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1772 states have (on average 1.3419864559819412) internal successors, (2378), 1774 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2378 transitions. [2021-10-30 23:57:49,181 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2378 transitions. Word has length 68 [2021-10-30 23:57:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:49,181 INFO L470 AbstractCegarLoop]: Abstraction has 1775 states and 2378 transitions. [2021-10-30 23:57:49,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2378 transitions. [2021-10-30 23:57:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-30 23:57:49,183 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:57:49,183 INFO L513 BasicCegarLoop]: 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] [2021-10-30 23:57:49,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-30 23:57:49,183 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-10-30 23:57:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:57:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1468975635, now seen corresponding path program 1 times [2021-10-30 23:57:49,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:57:49,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349594447] [2021-10-30 23:57:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:57:49,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:57:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:57:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-30 23:57:49,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:57:49,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349594447] [2021-10-30 23:57:49,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349594447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:57:49,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:57:49,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 23:57:49,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211147575] [2021-10-30 23:57:49,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:57:49,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:57:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:57:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:49,613 INFO L87 Difference]: Start difference. First operand 1775 states and 2378 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:57:51,867 INFO L93 Difference]: Finished difference Result 1775 states and 2378 transitions. [2021-10-30 23:57:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:57:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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) Word has length 70 [2021-10-30 23:57:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:57:51,868 INFO L225 Difference]: With dead ends: 1775 [2021-10-30 23:57:51,868 INFO L226 Difference]: Without dead ends: 0 [2021-10-30 23:57:51,870 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:57:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-30 23:57:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-30 23:57:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-30 23:57:51,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-10-30 23:57:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:57:51,871 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-30 23:57:51,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-30 23:57:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-30 23:57:51,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-30 23:57:51,874 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:57:51,874 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:57:51,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:57:51,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:57:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-30 23:57:51,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-30 23:57:51,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:51,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:52,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:53,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:54,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:55,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:57:57,476 INFO L857 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-10-30 23:57:57,476 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,476 INFO L853 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,476 INFO L853 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,477 INFO L857 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-10-30 23:57:57,477 INFO L853 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,477 INFO L857 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-10-30 23:57:57,477 INFO L857 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,477 INFO L853 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,477 INFO L857 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,477 INFO L857 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-10-30 23:57:57,477 INFO L853 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,478 INFO L853 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,478 INFO L853 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,478 INFO L857 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-10-30 23:57:57,478 INFO L853 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,478 INFO L857 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-10-30 23:57:57,478 INFO L857 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,478 INFO L857 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,478 INFO L853 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,479 INFO L853 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,479 INFO L853 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,479 INFO L857 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-10-30 23:57:57,479 INFO L857 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-10-30 23:57:57,479 INFO L853 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,479 INFO L857 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-10-30 23:57:57,479 INFO L857 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,479 INFO L853 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,480 INFO L857 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,480 INFO L857 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-10-30 23:57:57,480 INFO L853 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,480 INFO L853 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,480 INFO L853 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-10-30 23:57:57,480 INFO L857 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-10-30 23:57:57,480 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,481 INFO L853 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,481 INFO L857 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-10-30 23:57:57,481 INFO L853 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,481 INFO L857 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-10-30 23:57:57,481 INFO L857 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,481 INFO L857 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,481 INFO L853 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,481 INFO L857 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,482 INFO L853 garLoopResultBuilder]: At program point L5136(lines 5135 5137) 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) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,482 INFO L853 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,482 INFO L853 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,482 INFO L853 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,482 INFO L857 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,482 INFO L857 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-10-30 23:57:57,482 INFO L857 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,482 INFO L857 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-10-30 23:57:57,483 INFO L853 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,483 INFO L853 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,483 INFO L857 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-10-30 23:57:57,483 INFO L857 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-10-30 23:57:57,483 INFO L857 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-10-30 23:57:57,483 INFO L853 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,483 INFO L857 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,483 INFO L857 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-10-30 23:57:57,484 INFO L853 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (or (< 0 ULTIMATE.start_ir_init_~retval~0) (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0)) (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,484 INFO L853 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-10-30 23:57:57,484 INFO L857 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-10-30 23:57:57,484 INFO L857 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-10-30 23:57:57,484 INFO L857 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-10-30 23:57:57,484 INFO L853 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,484 INFO L857 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-10-30 23:57:57,484 INFO L857 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,485 INFO L857 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,485 INFO L857 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-10-30 23:57:57,485 INFO L857 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-10-30 23:57:57,485 INFO L857 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-10-30 23:57:57,485 INFO L853 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,485 INFO L853 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,485 INFO L853 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse3 (= ~ldv_urb_state~0 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse9 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse8 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse6 (= ULTIMATE.start_usb_free_urb_~urb.offset 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse9 .cse7 .cse8) (and .cse0 .cse1 (<= 1 ~ldv_urb_state~0) .cse2 (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (not .cse6) (<= ~ldv_urb_state~0 1) (not .cse9) .cse7 (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) .cse8))) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,486 INFO L853 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,487 INFO L857 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,487 INFO L853 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,487 INFO L857 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-10-30 23:57:57,487 INFO L857 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,487 INFO L857 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L853 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L853 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L853 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,488 INFO L853 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,488 INFO L853 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-10-30 23:57:57,488 INFO L857 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-10-30 23:57:57,489 INFO L853 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,489 INFO L857 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,489 INFO L857 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,489 INFO L857 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,489 INFO L853 garLoopResultBuilder]: At program point L5147(lines 5146 5148) 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) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,489 INFO L853 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,489 INFO L853 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,489 INFO L857 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-10-30 23:57:57,490 INFO L857 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-10-30 23:57:57,490 INFO L853 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,490 INFO L857 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,490 INFO L853 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,490 INFO L853 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,490 INFO L857 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-10-30 23:57:57,490 INFO L853 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,491 INFO L853 garLoopResultBuilder]: At program point L3695(lines 3689 3697) 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) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,491 INFO L853 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,491 INFO L853 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,491 INFO L857 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,491 INFO L857 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-10-30 23:57:57,491 INFO L853 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= ULTIMATE.start_usb_free_urb_~urb.offset 0) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,491 INFO L853 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= ULTIMATE.start_usb_free_urb_~urb.offset 0) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-10-30 23:57:57,492 INFO L853 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,492 INFO L853 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-10-30 23:57:57,492 INFO L857 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-10-30 23:57:57,493 INFO L857 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-10-30 23:57:57,493 INFO L857 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-10-30 23:57:57,493 INFO L853 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,493 INFO L857 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,493 INFO L853 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,493 INFO L857 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-10-30 23:57:57,493 INFO L857 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-10-30 23:57:57,494 INFO L853 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,494 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-30 23:57:57,494 INFO L853 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,494 INFO L853 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,494 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,494 INFO L857 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,494 INFO L853 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-10-30 23:57:57,495 INFO L853 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-10-30 23:57:57,495 INFO L853 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-10-30 23:57:57,495 INFO L857 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L857 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L853 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,496 INFO L857 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L853 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,496 INFO L857 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L857 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L857 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-10-30 23:57:57,496 INFO L853 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,497 INFO L853 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,497 INFO L857 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,497 INFO L853 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,497 INFO L857 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-10-30 23:57:57,497 INFO L853 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,497 INFO L857 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-10-30 23:57:57,497 INFO L853 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,497 INFO L857 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L853 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,498 INFO L857 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L857 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L857 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L857 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L853 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-10-30 23:57:57,498 INFO L857 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-10-30 23:57:57,498 INFO L853 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L853 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L857 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-10-30 23:57:57,499 INFO L853 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) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,500 INFO L857 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-10-30 23:57:57,500 INFO L853 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (or (< 0 ULTIMATE.start_ir_init_~retval~0) (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0)) (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,500 INFO L857 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,500 INFO L853 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,500 INFO L857 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-10-30 23:57:57,500 INFO L853 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,500 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,501 INFO L853 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,501 INFO L853 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse1 .cse3 .cse2 .cse5))) [2021-10-30 23:57:57,501 INFO L853 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,501 INFO L857 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,501 INFO L857 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-10-30 23:57:57,501 INFO L857 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-10-30 23:57:57,501 INFO L853 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,501 INFO L857 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-10-30 23:57:57,502 INFO L857 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,502 INFO L853 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,502 INFO L853 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,502 INFO L857 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-10-30 23:57:57,502 INFO L857 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-10-30 23:57:57,502 INFO L853 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,502 INFO L853 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,502 INFO L857 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-10-30 23:57:57,503 INFO L853 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,503 INFO L857 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-10-30 23:57:57,503 INFO L857 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-10-30 23:57:57,503 INFO L860 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-10-30 23:57:57,503 INFO L857 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-10-30 23:57:57,503 INFO L853 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,503 INFO L853 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,503 INFO L857 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-10-30 23:57:57,504 INFO L853 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,504 INFO L853 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,504 INFO L853 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,504 INFO L853 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,504 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-30 23:57:57,504 INFO L857 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-10-30 23:57:57,504 INFO L857 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-10-30 23:57:57,505 INFO L860 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-10-30 23:57:57,505 INFO L857 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-10-30 23:57:57,505 INFO L857 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-10-30 23:57:57,505 INFO L853 garLoopResultBuilder]: At program point L4645(lines 4614 4647) 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) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-10-30 23:57:57,505 INFO L853 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,505 INFO L853 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,505 INFO L857 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-10-30 23:57:57,505 INFO L853 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,506 INFO L857 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,507 INFO L857 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-10-30 23:57:57,507 INFO L853 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,507 INFO L853 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,507 INFO L853 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,507 INFO L857 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-10-30 23:57:57,507 INFO L853 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-10-30 23:57:57,507 INFO L853 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,507 INFO L857 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-10-30 23:57:57,508 INFO L853 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,508 INFO L853 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,508 INFO L857 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-10-30 23:57:57,508 INFO L857 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-10-30 23:57:57,508 INFO L853 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,508 INFO L853 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,508 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-30 23:57:57,509 INFO L853 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,509 INFO L853 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-10-30 23:57:57,509 INFO L853 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,509 INFO L857 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-10-30 23:57:57,509 INFO L857 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-10-30 23:57:57,509 INFO L857 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-10-30 23:57:57,509 INFO L857 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-10-30 23:57:57,509 INFO L857 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-10-30 23:57:57,510 INFO L853 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,510 INFO L857 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-10-30 23:57:57,510 INFO L857 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-10-30 23:57:57,510 INFO L853 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,510 INFO L860 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-10-30 23:57:57,510 INFO L860 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-10-30 23:57:57,510 INFO L853 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,510 INFO L853 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-10-30 23:57:57,511 INFO L853 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,511 INFO L857 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-10-30 23:57:57,511 INFO L857 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-10-30 23:57:57,511 INFO L853 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-10-30 23:57:57,514 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:57:57,515 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-30 23:57:57,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.10 11:57:57 BoogieIcfgContainer [2021-10-30 23:57:57,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-30 23:57:57,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-30 23:57:57,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-30 23:57:57,596 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-30 23:57:57,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:57:40" (3/4) ... [2021-10-30 23:57:57,599 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-30 23:57:57,633 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2021-10-30 23:57:57,635 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2021-10-30 23:57:57,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-30 23:57:57,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-30 23:57:57,640 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-30 23:57:57,642 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-30 23:57:57,644 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-30 23:57:57,645 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-30 23:57:57,670 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,670 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,670 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && urb == 0) && \result == 0) && \result == 0) || (((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || ((((((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && \result == 0) && !(\result == 0)) && \result == 0) [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && \result == 0) && !(\result == 0)) && ldv_urb_state == 0) && !(\result == 0)) && \result == 0) || (((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 [2021-10-30 23:57:57,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-10-30 23:57:57,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 [2021-10-30 23:57:57,887 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-30 23:57:57,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-30 23:57:57,889 INFO L168 Benchmark]: Toolchain (without parser) took 22768.36 ms. Allocated memory was 90.2 MB in the beginning and 394.3 MB in the end (delta: 304.1 MB). Free memory was 54.2 MB in the beginning and 252.5 MB in the end (delta: -198.4 MB). Peak memory consumption was 251.0 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,889 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 90.2 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-30 23:57:57,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1096.49 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 54.0 MB in the beginning and 65.2 MB in the end (delta: -11.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.04 ms. Allocated memory is still 111.1 MB. Free memory was 65.2 MB in the beginning and 55.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,890 INFO L168 Benchmark]: Boogie Preprocessor took 121.70 ms. Allocated memory is still 111.1 MB. Free memory was 55.2 MB in the beginning and 46.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,890 INFO L168 Benchmark]: RCFGBuilder took 4195.44 ms. Allocated memory was 111.1 MB in the beginning and 182.5 MB in the end (delta: 71.3 MB). Free memory was 46.3 MB in the beginning and 82.5 MB in the end (delta: -36.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,891 INFO L168 Benchmark]: TraceAbstraction took 16938.42 ms. Allocated memory was 182.5 MB in the beginning and 394.3 MB in the end (delta: 211.8 MB). Free memory was 81.4 MB in the beginning and 166.6 MB in the end (delta: -85.2 MB). Peak memory consumption was 193.2 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,891 INFO L168 Benchmark]: Witness Printer took 291.74 ms. Allocated memory is still 394.3 MB. Free memory was 166.6 MB in the beginning and 252.5 MB in the end (delta: -86.0 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.1 GB. [2021-10-30 23:57:57,892 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.18 ms. Allocated memory is still 90.2 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1096.49 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 54.0 MB in the beginning and 65.2 MB in the end (delta: -11.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 118.04 ms. Allocated memory is still 111.1 MB. Free memory was 65.2 MB in the beginning and 55.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.70 ms. Allocated memory is still 111.1 MB. Free memory was 55.2 MB in the beginning and 46.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4195.44 ms. Allocated memory was 111.1 MB in the beginning and 182.5 MB in the end (delta: 71.3 MB). Free memory was 46.3 MB in the beginning and 82.5 MB in the end (delta: -36.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16938.42 ms. Allocated memory was 182.5 MB in the beginning and 394.3 MB in the end (delta: 211.8 MB). Free memory was 81.4 MB in the beginning and 166.6 MB in the end (delta: -85.2 MB). Peak memory consumption was 193.2 MB. Max. memory is 16.1 GB. * Witness Printer took 291.74 ms. Allocated memory is still 394.3 MB. Free memory was 166.6 MB in the beginning and 252.5 MB in the end (delta: -86.0 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.1 GB. * 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 - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7594 SDtfs, 9763 SDslu, 14839 SDs, 0 SdLazy, 801 SolverSat, 54 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2687occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 10556 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 913 NumberOfFragments, 2304 HoareAnnotationTreeSize, 128 FomulaSimplifications, 1398281 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 128 FomulaSimplificationsInter, 5035 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 24/24 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 4 specifications checked. All of them hold - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5131]: 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) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 < retval || retval + 1 <= 0) && ldv_coherent_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5097]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && \result == 0) && !(\result == 0)) && ldv_urb_state == 0) && !(\result == 0)) && \result == 0) || (((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4860]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4614]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5146]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 5047]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: (((((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && urb == 0) && \result == 0) && \result == 0) || (((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || ((((((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && \result == 0) && !(\result == 0)) && \result == 0) - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5135]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4616]: Loop Invariant Derived loop invariant: ((((((0 < retval || retval + 1 <= 0) && ldv_coherent_state == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3689]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 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) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 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) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) RESULT: Ultimate proved your program to be correct! [2021-10-30 23:57:57,964 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...