./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 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:01:53,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:01:53,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:01:53,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:01:53,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:01:53,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:01:53,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:01:53,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:01:53,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:01:53,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:01:53,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:01:53,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:01:53,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:01:53,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:01:53,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:01:53,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:01:53,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:01:53,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:01:53,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:01:53,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:01:53,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:01:53,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:01:53,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:01:53,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:01:53,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:01:53,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:01:53,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:01:53,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:01:53,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:01:53,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:01:53,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:01:53,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:01:53,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:01:53,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:01:53,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:01:53,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:01:53,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:01:53,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:01:53,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:01:53,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:01:53,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:01:53,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 12:01:53,861 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:01:53,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:01:53,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:01:53,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:01:53,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:01:53,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:01:53,864 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:01:53,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:01:53,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 12:01:53,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:01:53,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:01:53,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:01:53,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:01:53,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:01:53,866 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:01:53,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:01:53,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:01:53,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:01:53,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:01:53,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:53,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:01:53,867 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:01:53,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:01:53,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:01:53,869 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-11-06 12:01:54,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:01:54,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:01:54,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:01:54,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:01:54,059 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:01:54,060 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-11-06 12:01:54,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68ebdd73/28c35e54a8ff4cffa2ce08eb29cf736c/FLAG1bdf6baf6 [2021-11-06 12:01:54,664 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:01:54,664 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-11-06 12:01:54,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68ebdd73/28c35e54a8ff4cffa2ce08eb29cf736c/FLAG1bdf6baf6 [2021-11-06 12:01:55,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68ebdd73/28c35e54a8ff4cffa2ce08eb29cf736c [2021-11-06 12:01:55,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:01:55,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:01:55,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:55,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:01:55,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:01:55,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:55,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1784ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55, skipping insertion in model container [2021-11-06 12:01:55,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:55,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:01:55,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:01:55,732 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-11-06 12:01:55,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:55,795 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:01:55,944 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-11-06 12:01:55,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:55,980 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:01:55,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55 WrapperNode [2021-11-06 12:01:55,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:55,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:55,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:01:55,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:01:55,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:56,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:01:56,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:01:56,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:01:56,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:01:56,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:01:56,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:01:56,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:01:56,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (1/1) ... [2021-11-06 12:01:56,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:01:56,139 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-11-06 12:01:56,154 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-11-06 12:01:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:01:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:01:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 12:01:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:01:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:01:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:01:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 12:01:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 12:01:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:01:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:01:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:01:56,496 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:56,501 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:56,502 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:56,504 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:56,522 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:59,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2021-11-06 12:01:59,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2021-11-06 12:01:59,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-11-06 12:01:59,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-11-06 12:01:59,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##339: assume false; [2021-11-06 12:01:59,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume !false; [2021-11-06 12:01:59,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2021-11-06 12:01:59,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2021-11-06 12:01:59,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2021-11-06 12:01:59,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2021-11-06 12:02:00,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:02:00,000 INFO L299 CfgBuilder]: Removed 156 assume(true) statements. [2021-11-06 12:02:00,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:00 BoogieIcfgContainer [2021-11-06 12:02:00,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:02:00,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:02:00,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:02:00,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:02:00,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:01:55" (1/3) ... [2021-11-06 12:02:00,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b41a768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:00, skipping insertion in model container [2021-11-06 12:02:00,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:55" (2/3) ... [2021-11-06 12:02:00,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b41a768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:00, skipping insertion in model container [2021-11-06 12:02:00,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:00" (3/3) ... [2021-11-06 12:02:00,009 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-11-06 12:02:00,013 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:02:00,013 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-06 12:02:00,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:02:00,056 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-11-06 12:02:00,056 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-06 12:02:00,074 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-11-06 12:02:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 12:02:00,085 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:00,085 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:00,085 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-11-06 12:02:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:00,089 INFO L85 PathProgramCache]: Analyzing trace with hash 986721885, now seen corresponding path program 1 times [2021-11-06 12:02:00,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:00,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330899562] [2021-11-06 12:02:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:00,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:00,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:00,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330899562] [2021-11-06 12:02:00,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330899562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:00,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:00,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:00,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351995419] [2021-11-06 12:02:00,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:00,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:00,515 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-11-06 12:02:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:00,757 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-11-06 12:02:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:00,759 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-11-06 12:02:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:00,768 INFO L225 Difference]: With dead ends: 788 [2021-11-06 12:02:00,768 INFO L226 Difference]: Without dead ends: 502 [2021-11-06 12:02:00,770 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-11-06 12:02:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-06 12:02:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 272. [2021-11-06 12:02:00,802 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-11-06 12:02:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2021-11-06 12:02:00,804 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 12 [2021-11-06 12:02:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:00,804 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2021-11-06 12:02:00,804 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-11-06 12:02:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2021-11-06 12:02:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 12:02:00,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:00,805 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:00,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 12:02:00,805 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-11-06 12:02:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1666780255, now seen corresponding path program 1 times [2021-11-06 12:02:00,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:00,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352561301] [2021-11-06 12:02:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:00,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:00,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:00,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352561301] [2021-11-06 12:02:00,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352561301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:00,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:00,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:02:00,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168865280] [2021-11-06 12:02:00,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:00,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:00,903 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-11-06 12:02:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:00,941 INFO L93 Difference]: Finished difference Result 781 states and 1056 transitions. [2021-11-06 12:02:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:00,942 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-11-06 12:02:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:00,944 INFO L225 Difference]: With dead ends: 781 [2021-11-06 12:02:00,944 INFO L226 Difference]: Without dead ends: 523 [2021-11-06 12:02:00,945 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-11-06 12:02:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-11-06 12:02:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2021-11-06 12:02:00,959 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-11-06 12:02:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 703 transitions. [2021-11-06 12:02:00,961 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 703 transitions. Word has length 12 [2021-11-06 12:02:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:00,961 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 703 transitions. [2021-11-06 12:02:00,961 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-11-06 12:02:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 703 transitions. [2021-11-06 12:02:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-06 12:02:00,962 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:00,962 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:00,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 12:02:00,962 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-11-06 12:02:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 130579806, now seen corresponding path program 1 times [2021-11-06 12:02:00,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:00,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365485195] [2021-11-06 12:02:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:00,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:01,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:01,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365485195] [2021-11-06 12:02:01,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365485195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:01,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:01,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:02:01,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562933040] [2021-11-06 12:02:01,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:01,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:01,063 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-11-06 12:02:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:01,070 INFO L93 Difference]: Finished difference Result 519 states and 703 transitions. [2021-11-06 12:02:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:01,071 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-11-06 12:02:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:01,072 INFO L225 Difference]: With dead ends: 519 [2021-11-06 12:02:01,072 INFO L226 Difference]: Without dead ends: 513 [2021-11-06 12:02:01,073 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-11-06 12:02:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-06 12:02:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-11-06 12:02:01,083 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-11-06 12:02:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 694 transitions. [2021-11-06 12:02:01,084 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 694 transitions. Word has length 13 [2021-11-06 12:02:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:01,084 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 694 transitions. [2021-11-06 12:02:01,084 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-11-06 12:02:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 694 transitions. [2021-11-06 12:02:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 12:02:01,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:01,087 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-11-06 12:02:01,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 12:02:01,087 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-11-06 12:02:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1133933506, now seen corresponding path program 1 times [2021-11-06 12:02:01,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:01,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463631094] [2021-11-06 12:02:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:01,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:01,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:01,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463631094] [2021-11-06 12:02:01,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463631094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:01,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:01,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:01,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054947311] [2021-11-06 12:02:01,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:01,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:01,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:01,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:01,197 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-11-06 12:02:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:01,370 INFO L93 Difference]: Finished difference Result 1458 states and 1991 transitions. [2021-11-06 12:02:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:01,371 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-11-06 12:02:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:01,374 INFO L225 Difference]: With dead ends: 1458 [2021-11-06 12:02:01,374 INFO L226 Difference]: Without dead ends: 959 [2021-11-06 12:02:01,374 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-11-06 12:02:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-11-06 12:02:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2021-11-06 12:02:01,405 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-11-06 12:02:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1301 transitions. [2021-11-06 12:02:01,407 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1301 transitions. Word has length 49 [2021-11-06 12:02:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:01,408 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1301 transitions. [2021-11-06 12:02:01,408 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-11-06 12:02:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1301 transitions. [2021-11-06 12:02:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 12:02:01,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:01,414 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-11-06 12:02:01,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 12:02:01,414 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-11-06 12:02:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1156565760, now seen corresponding path program 1 times [2021-11-06 12:02:01,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:01,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198301396] [2021-11-06 12:02:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:01,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:01,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:01,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198301396] [2021-11-06 12:02:01,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198301396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:01,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:01,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:02:01,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748982991] [2021-11-06 12:02:01,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:01,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:01,546 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-11-06 12:02:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:01,812 INFO L93 Difference]: Finished difference Result 5883 states and 8075 transitions. [2021-11-06 12:02:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:02:01,813 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-11-06 12:02:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:01,827 INFO L225 Difference]: With dead ends: 5883 [2021-11-06 12:02:01,828 INFO L226 Difference]: Without dead ends: 5410 [2021-11-06 12:02:01,830 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-11-06 12:02:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-11-06 12:02:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 959. [2021-11-06 12:02:01,892 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-11-06 12:02:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1313 transitions. [2021-11-06 12:02:01,894 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1313 transitions. Word has length 49 [2021-11-06 12:02:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:01,895 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 1313 transitions. [2021-11-06 12:02:01,895 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-11-06 12:02:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1313 transitions. [2021-11-06 12:02:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 12:02:01,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:01,896 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-11-06 12:02:01,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 12:02:01,897 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-11-06 12:02:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 145448510, now seen corresponding path program 1 times [2021-11-06 12:02:01,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:01,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708745787] [2021-11-06 12:02:01,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:01,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:02,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:02,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708745787] [2021-11-06 12:02:02,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708745787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:02,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:02,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:02:02,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118506287] [2021-11-06 12:02:02,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:02:02,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:02:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:02,004 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-11-06 12:02:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:02,442 INFO L93 Difference]: Finished difference Result 3721 states and 5095 transitions. [2021-11-06 12:02:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 12:02:02,443 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-11-06 12:02:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:02,451 INFO L225 Difference]: With dead ends: 3721 [2021-11-06 12:02:02,452 INFO L226 Difference]: Without dead ends: 2776 [2021-11-06 12:02:02,454 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-11-06 12:02:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-06 12:02:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 957. [2021-11-06 12:02:02,508 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-11-06 12:02:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1307 transitions. [2021-11-06 12:02:02,510 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1307 transitions. Word has length 49 [2021-11-06 12:02:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:02,511 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 1307 transitions. [2021-11-06 12:02:02,511 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-11-06 12:02:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1307 transitions. [2021-11-06 12:02:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:02:02,512 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:02,512 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-11-06 12:02:02,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 12:02:02,512 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-11-06 12:02:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1338025611, now seen corresponding path program 1 times [2021-11-06 12:02:02,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:02,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698206841] [2021-11-06 12:02:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:02,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:02,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:02,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698206841] [2021-11-06 12:02:02,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698206841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:02,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:02,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:02:02,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684669675] [2021-11-06 12:02:02,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:02,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:02,621 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-11-06 12:02:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:02,730 INFO L93 Difference]: Finished difference Result 2709 states and 3722 transitions. [2021-11-06 12:02:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:02,731 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-11-06 12:02:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:02,736 INFO L225 Difference]: With dead ends: 2709 [2021-11-06 12:02:02,736 INFO L226 Difference]: Without dead ends: 1766 [2021-11-06 12:02:02,739 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-11-06 12:02:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2021-11-06 12:02:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 929. [2021-11-06 12:02:02,785 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-11-06 12:02:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1267 transitions. [2021-11-06 12:02:02,787 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1267 transitions. Word has length 52 [2021-11-06 12:02:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:02,789 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1267 transitions. [2021-11-06 12:02:02,789 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-11-06 12:02:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1267 transitions. [2021-11-06 12:02:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:02:02,791 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:02,791 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-11-06 12:02:02,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 12:02:02,791 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-11-06 12:02:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1261439541, now seen corresponding path program 1 times [2021-11-06 12:02:02,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:02,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880948096] [2021-11-06 12:02:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:02,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:02,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:02,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880948096] [2021-11-06 12:02:02,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880948096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:02,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:02,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:02,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602152983] [2021-11-06 12:02:02,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:02,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:02,918 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-11-06 12:02:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:05,161 INFO L93 Difference]: Finished difference Result 1415 states and 1927 transitions. [2021-11-06 12:02:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:05,162 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-11-06 12:02:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:05,165 INFO L225 Difference]: With dead ends: 1415 [2021-11-06 12:02:05,165 INFO L226 Difference]: Without dead ends: 1411 [2021-11-06 12:02:05,166 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-11-06 12:02:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-11-06 12:02:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1400. [2021-11-06 12:02:05,267 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-11-06 12:02:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1912 transitions. [2021-11-06 12:02:05,273 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1912 transitions. Word has length 52 [2021-11-06 12:02:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:05,274 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1912 transitions. [2021-11-06 12:02:05,274 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-11-06 12:02:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1912 transitions. [2021-11-06 12:02:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 12:02:05,281 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:05,281 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-11-06 12:02:05,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 12:02:05,282 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-11-06 12:02:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1042941183, now seen corresponding path program 1 times [2021-11-06 12:02:05,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:05,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985585758] [2021-11-06 12:02:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:05,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:05,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:05,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985585758] [2021-11-06 12:02:05,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985585758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:05,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:05,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:05,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529996735] [2021-11-06 12:02:05,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:05,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:05,420 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-11-06 12:02:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:05,743 INFO L93 Difference]: Finished difference Result 6295 states and 8608 transitions. [2021-11-06 12:02:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:02:05,744 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-11-06 12:02:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:05,757 INFO L225 Difference]: With dead ends: 6295 [2021-11-06 12:02:05,757 INFO L226 Difference]: Without dead ends: 4909 [2021-11-06 12:02:05,760 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-11-06 12:02:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2021-11-06 12:02:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 2687. [2021-11-06 12:02:05,886 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-11-06 12:02:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3658 transitions. [2021-11-06 12:02:05,891 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3658 transitions. Word has length 58 [2021-11-06 12:02:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:05,891 INFO L470 AbstractCegarLoop]: Abstraction has 2687 states and 3658 transitions. [2021-11-06 12:02:05,891 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-11-06 12:02:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3658 transitions. [2021-11-06 12:02:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 12:02:05,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:05,893 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-11-06 12:02:05,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 12:02:05,893 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-11-06 12:02:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1699019577, now seen corresponding path program 1 times [2021-11-06 12:02:05,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:05,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677868093] [2021-11-06 12:02:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:05,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:05,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:05,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677868093] [2021-11-06 12:02:05,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677868093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:05,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:05,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:05,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994560187] [2021-11-06 12:02:05,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:05,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:05,972 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-11-06 12:02:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:06,261 INFO L93 Difference]: Finished difference Result 5265 states and 7149 transitions. [2021-11-06 12:02:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:06,261 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-11-06 12:02:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:06,274 INFO L225 Difference]: With dead ends: 5265 [2021-11-06 12:02:06,274 INFO L226 Difference]: Without dead ends: 2592 [2021-11-06 12:02:06,279 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-11-06 12:02:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2021-11-06 12:02:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2573. [2021-11-06 12:02:06,388 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-11-06 12:02:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3484 transitions. [2021-11-06 12:02:06,392 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3484 transitions. Word has length 58 [2021-11-06 12:02:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:06,394 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 3484 transitions. [2021-11-06 12:02:06,394 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-11-06 12:02:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3484 transitions. [2021-11-06 12:02:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 12:02:06,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:06,395 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-11-06 12:02:06,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 12:02:06,396 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-11-06 12:02:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash 589140347, now seen corresponding path program 1 times [2021-11-06 12:02:06,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:06,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064443312] [2021-11-06 12:02:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:06,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:06,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:06,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064443312] [2021-11-06 12:02:06,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064443312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:06,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:06,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 12:02:06,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477596139] [2021-11-06 12:02:06,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 12:02:06,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 12:02:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:02:06,613 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-11-06 12:02:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:07,137 INFO L93 Difference]: Finished difference Result 4491 states and 6067 transitions. [2021-11-06 12:02:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 12:02:07,138 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-11-06 12:02:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:07,146 INFO L225 Difference]: With dead ends: 4491 [2021-11-06 12:02:07,146 INFO L226 Difference]: Without dead ends: 2728 [2021-11-06 12:02:07,148 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-11-06 12:02:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2021-11-06 12:02:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1777. [2021-11-06 12:02:07,249 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-11-06 12:02:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2382 transitions. [2021-11-06 12:02:07,252 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2382 transitions. Word has length 66 [2021-11-06 12:02:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:07,253 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 2382 transitions. [2021-11-06 12:02:07,253 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-11-06 12:02:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2382 transitions. [2021-11-06 12:02:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 12:02:07,254 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:07,254 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-11-06 12:02:07,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 12:02:07,255 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-11-06 12:02:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1323881078, now seen corresponding path program 1 times [2021-11-06 12:02:07,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:07,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233453575] [2021-11-06 12:02:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:07,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:02:07,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:07,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233453575] [2021-11-06 12:02:07,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233453575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:07,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:07,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:02:07,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005278572] [2021-11-06 12:02:07,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:07,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:07,666 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-11-06 12:02:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:07,802 INFO L93 Difference]: Finished difference Result 3542 states and 4750 transitions. [2021-11-06 12:02:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:02:07,803 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-11-06 12:02:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:07,808 INFO L225 Difference]: With dead ends: 3542 [2021-11-06 12:02:07,808 INFO L226 Difference]: Without dead ends: 1775 [2021-11-06 12:02:07,810 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-11-06 12:02:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-11-06 12:02:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2021-11-06 12:02:07,894 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-11-06 12:02:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2378 transitions. [2021-11-06 12:02:07,897 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2378 transitions. Word has length 68 [2021-11-06 12:02:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:07,898 INFO L470 AbstractCegarLoop]: Abstraction has 1775 states and 2378 transitions. [2021-11-06 12:02:07,898 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-11-06 12:02:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2378 transitions. [2021-11-06 12:02:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 12:02:07,899 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:07,899 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-11-06 12:02:07,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 12:02:07,900 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-11-06 12:02:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1468975635, now seen corresponding path program 1 times [2021-11-06 12:02:07,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:07,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517625089] [2021-11-06 12:02:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:07,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:02:08,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:08,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517625089] [2021-11-06 12:02:08,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517625089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:08,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:08,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:08,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302378741] [2021-11-06 12:02:08,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:08,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:08,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:08,193 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-11-06 12:02:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:10,398 INFO L93 Difference]: Finished difference Result 1775 states and 2378 transitions. [2021-11-06 12:02:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:10,399 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-11-06 12:02:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:10,399 INFO L225 Difference]: With dead ends: 1775 [2021-11-06 12:02:10,399 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 12:02:10,401 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-11-06 12:02:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 12:02:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 12:02:10,401 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-11-06 12:02:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 12:02:10,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-11-06 12:02:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:10,402 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 12:02:10,402 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-11-06 12:02:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 12:02:10,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 12:02:10,404 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,405 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,405 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,405 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 12:02:10,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 12:02:10,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:10,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:11,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:12,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:13,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 12:02:14,858 INFO L857 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-11-06 12:02:14,858 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,858 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-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 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-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 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-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-11-06 12:02:14,859 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-11-06 12:02:14,859 INFO L857 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 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-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,860 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-11-06 12:02:14,860 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-11-06 12:02:14,860 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-11-06 12:02:14,860 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-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-11-06 12:02:14,860 INFO L857 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-11-06 12:02:14,861 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-11-06 12:02:14,861 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-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-11-06 12:02:14,861 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-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-11-06 12:02:14,861 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-11-06 12:02:14,861 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-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-11-06 12:02:14,861 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-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-11-06 12:02:14,861 INFO L857 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-11-06 12:02:14,861 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-11-06 12:02:14,861 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-11-06 12:02:14,861 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-11-06 12:02:14,861 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,862 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-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-11-06 12:02:14,862 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-11-06 12:02:14,862 INFO L857 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,862 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-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-11-06 12:02:14,863 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-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,863 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-11-06 12:02:14,863 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-11-06 12:02:14,863 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-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-11-06 12:02:14,863 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-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,863 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-11-06 12:02:14,863 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-11-06 12:02:14,863 INFO L857 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-11-06 12:02:14,863 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-11-06 12:02:14,863 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-11-06 12:02:14,863 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-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 12:02:14,864 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-11-06 12:02:14,864 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-11-06 12:02:14,864 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-11-06 12:02:14,865 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-11-06 12:02:14,865 INFO L857 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,866 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,866 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-11-06 12:02:14,867 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-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-11-06 12:02:14,867 INFO L860 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 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-11-06 12:02:14,867 INFO L857 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-11-06 12:02:14,867 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-11-06 12:02:14,867 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-11-06 12:02:14,868 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-11-06 12:02:14,868 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-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L860 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-11-06 12:02:14,868 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-11-06 12:02:14,868 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-11-06 12:02:14,868 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-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-11-06 12:02:14,868 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-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-11-06 12:02:14,868 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-11-06 12:02:14,868 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-11-06 12:02:14,868 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-11-06 12:02:14,868 INFO L857 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 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-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-11-06 12:02:14,869 INFO L857 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-11-06 12:02:14,869 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-11-06 12:02:14,869 INFO L860 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-11-06 12:02:14,869 INFO L860 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-11-06 12:02:14,870 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-11-06 12:02:14,870 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-11-06 12:02:14,870 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-11-06 12:02:14,870 INFO L857 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-11-06 12:02:14,870 INFO L857 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-11-06 12:02:14,870 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-11-06 12:02:14,872 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:14,873 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:02:14,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:02:14 BoogieIcfgContainer [2021-11-06 12:02:14,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:02:14,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:02:14,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:02:14,927 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:02:14,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:00" (3/4) ... [2021-11-06 12:02:14,932 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 12:02:14,956 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2021-11-06 12:02:14,957 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2021-11-06 12:02:14,959 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-06 12:02:14,960 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-11-06 12:02:14,961 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-06 12:02:14,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-06 12:02:14,963 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 12:02:14,965 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 12:02:14,989 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-11-06 12:02:14,989 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-11-06 12:02:14,989 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-11-06 12:02:14,989 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-11-06 12:02:14,989 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,990 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,991 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-11-06 12:02:14,992 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-11-06 12:02:14,992 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-11-06 12:02:14,992 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-11-06 12:02:14,992 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-11-06 12:02:14,992 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-11-06 12:02:14,992 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-11-06 12:02:14,992 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,992 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-11-06 12:02:14,992 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,992 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-11-06 12:02:14,993 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-11-06 12:02:14,993 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-11-06 12:02:14,993 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-11-06 12:02:14,993 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-11-06 12:02:14,993 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,993 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-11-06 12:02:14,993 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-11-06 12:02:14,993 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,993 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,993 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,993 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-11-06 12:02:14,994 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,994 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-11-06 12:02:14,994 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-11-06 12:02:14,994 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-11-06 12:02:14,994 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,994 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-11-06 12:02:14,994 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,994 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-11-06 12:02:14,994 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-11-06 12:02:14,994 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-11-06 12:02:14,994 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-11-06 12:02:14,995 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-11-06 12:02:14,995 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,995 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-11-06 12:02:14,995 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,995 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-11-06 12:02:14,995 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-11-06 12:02:14,995 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,995 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-11-06 12:02:14,995 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-11-06 12:02:14,995 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,996 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-11-06 12:02:14,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,996 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-11-06 12:02:14,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,996 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-11-06 12:02:14,996 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-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 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-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,997 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-11-06 12:02:14,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 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-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 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-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 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-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:14,999 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-11-06 12:02:14,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-06 12:02:15,001 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-11-06 12:02:15,001 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-11-06 12:02:15,001 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-11-06 12:02:15,001 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-11-06 12:02:15,185 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 12:02:15,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:02:15,187 INFO L168 Benchmark]: Toolchain (without parser) took 20102.42 ms. Allocated memory was 96.5 MB in the beginning and 400.6 MB in the end (delta: 304.1 MB). Free memory was 58.6 MB in the beginning and 286.7 MB in the end (delta: -228.1 MB). Peak memory consumption was 253.5 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,187 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 96.5 MB. Free memory was 54.0 MB in the beginning and 53.9 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:02:15,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 895.45 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 58.6 MB in the beginning and 74.6 MB in the end (delta: -16.0 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.59 ms. Allocated memory is still 127.9 MB. Free memory was 74.6 MB in the beginning and 64.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,188 INFO L168 Benchmark]: Boogie Preprocessor took 58.22 ms. Allocated memory is still 127.9 MB. Free memory was 64.8 MB in the beginning and 55.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,188 INFO L168 Benchmark]: RCFGBuilder took 3892.03 ms. Allocated memory was 127.9 MB in the beginning and 230.7 MB in the end (delta: 102.8 MB). Free memory was 55.8 MB in the beginning and 165.2 MB in the end (delta: -109.4 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,188 INFO L168 Benchmark]: TraceAbstraction took 14921.52 ms. Allocated memory was 230.7 MB in the beginning and 400.6 MB in the end (delta: 169.9 MB). Free memory was 164.1 MB in the beginning and 196.8 MB in the end (delta: -32.7 MB). Peak memory consumption was 232.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,189 INFO L168 Benchmark]: Witness Printer took 259.05 ms. Allocated memory is still 400.6 MB. Free memory was 196.8 MB in the beginning and 286.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 88.3 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:15,190 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.17 ms. Allocated memory is still 96.5 MB. Free memory was 54.0 MB in the beginning and 53.9 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 895.45 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 58.6 MB in the beginning and 74.6 MB in the end (delta: -16.0 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.59 ms. Allocated memory is still 127.9 MB. Free memory was 74.6 MB in the beginning and 64.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.22 ms. Allocated memory is still 127.9 MB. Free memory was 64.8 MB in the beginning and 55.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3892.03 ms. Allocated memory was 127.9 MB in the beginning and 230.7 MB in the end (delta: 102.8 MB). Free memory was 55.8 MB in the beginning and 165.2 MB in the end (delta: -109.4 MB). Peak memory consumption was 85.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14921.52 ms. Allocated memory was 230.7 MB in the beginning and 400.6 MB in the end (delta: 169.9 MB). Free memory was 164.1 MB in the beginning and 196.8 MB in the end (delta: -32.7 MB). Peak memory consumption was 232.0 MB. Max. memory is 16.1 GB. * Witness Printer took 259.05 ms. Allocated memory is still 400.6 MB. Free memory was 196.8 MB in the beginning and 286.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 88.3 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: 14.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7594 SDtfs, 9763 SDslu, 14839 SDs, 0 SdLazy, 800 SolverSat, 54 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.0s 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: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 10556 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 913 NumberOfFragments, 2304 HoareAnnotationTreeSize, 128 FomulaSimplifications, 1398281 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 128 FomulaSimplificationsInter, 5035 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.9s 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-11-06 12:02:15,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE