./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc --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 0b6cec80466d26e7f9fcd66257be2e9ddc0be03c06ed1a001e454a4fe37aa1e9
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:46:24,742 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:46:24,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:46:24,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:46:24,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:46:24,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:46:24,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:46:24,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:46:24,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:46:24,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:46:24,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:46:24,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:46:24,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:46:24,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:46:24,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:46:24,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:46:24,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:46:24,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:46:24,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:46:24,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:46:24,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:46:24,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:46:24,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:46:24,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:46:24,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:46:24,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:46:24,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:46:24,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:46:24,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:46:24,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:46:24,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:46:24,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:46:24,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:46:24,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:46:24,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:46:24,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:46:24,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:46:24,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:46:24,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:46:24,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:46:24,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:46:24,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf
[2022-11-02 20:46:24,844 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:46:24,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:46:24,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:46:24,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:46:24,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:46:24,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:46:24,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:46:24,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:46:24,848 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:46:24,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:46:24,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:46:24,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:46:24,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:46:24,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:46:24,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:46:24,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:46:24,850 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:46:24,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:46:24,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:46:24,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:46:24,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:46:24,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:46:24,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:46:24,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:46:24,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:46:24,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:46:24,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:46:24,852 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:46:24,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:46:24,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:46:24,853 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc
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 -> 0b6cec80466d26e7f9fcd66257be2e9ddc0be03c06ed1a001e454a4fe37aa1e9
[2022-11-02 20:46:25,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:46:25,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:46:25,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:46:25,267 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:46:25,269 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:46:25,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i
[2022-11-02 20:46:25,377 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/data/3337aacf9/32c46095254c44d0808821299191172a/FLAG9dd0376bb
[2022-11-02 20:46:26,197 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:46:26,198 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i
[2022-11-02 20:46:26,232 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/data/3337aacf9/32c46095254c44d0808821299191172a/FLAG9dd0376bb
[2022-11-02 20:46:26,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/data/3337aacf9/32c46095254c44d0808821299191172a
[2022-11-02 20:46:26,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:46:26,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:46:26,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:46:26,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:46:26,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:46:26,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:26" (1/1) ...
[2022-11-02 20:46:26,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fa022b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:26, skipping insertion in model container
[2022-11-02 20:46:26,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:26" (1/1) ...
[2022-11-02 20:46:26,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:46:26,433 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:46:26,945 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2715]
[2022-11-02 20:46:26,946 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * ,
size_t ) [2716-2717]
[2022-11-02 20:46:27,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i[78841,78854]
[2022-11-02 20:46:27,766 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:46:27,803 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:46:27,942 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2715]
[2022-11-02 20:46:27,942 WARN L1244 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * ,
size_t ) [2716-2717]
[2022-11-02 20:46:27,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i[78841,78854]
[2022-11-02 20:46:28,166 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:46:28,231 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:46:28,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28 WrapperNode
[2022-11-02 20:46:28,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:46:28,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:46:28,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:46:28,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:46:28,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,410 INFO L138 Inliner]: procedures = 143, calls = 649, calls flagged for inlining = 56, calls inlined = 52, statements flattened = 1892
[2022-11-02 20:46:28,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:46:28,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:46:28,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:46:28,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:46:28,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,518 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:46:28,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:46:28,542 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:46:28,542 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:46:28,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (1/1) ...
[2022-11-02 20:46:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:46:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:46:28,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:46:28,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:46:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2022-11-02 20:46:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure msleep
[2022-11-02 20:46:28,658 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep
[2022-11-02 20:46:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure devm_request_threaded_irq
[2022-11-02 20:46:28,658 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_request_threaded_irq
[2022-11-02 20:46:28,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$
[2022-11-02 20:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb
[2022-11-02 20:46:28,661 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb
[2022-11-02 20:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2022-11-02 20:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop
[2022-11-02 20:46:28,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop
[2022-11-02 20:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-02 20:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push
[2022-11-02 20:46:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push
[2022-11-02 20:46:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata
[2022-11-02 20:46:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata
[2022-11-02 20:46:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure reg_check_1
[2022-11-02 20:46:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_check_1
[2022-11-02 20:46:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2022-11-02 20:46:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2022-11-02 20:46:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim
[2022-11-02 20:46:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim
[2022-11-02 20:46:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags
[2022-11-02 20:46:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags
[2022-11-02 20:46:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure print_hex_dump
[2022-11-02 20:46:28,665 INFO L138 BoogieDeclarations]: Found implementation of procedure print_hex_dump
[2022-11-02 20:46:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure usleep_range
[2022-11-02 20:46:28,665 INFO L138 BoogieDeclarations]: Found implementation of procedure usleep_range
[2022-11-02 20:46:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure devm_gpio_request
[2022-11-02 20:46:28,665 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_gpio_request
[2022-11-02 20:46:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 20:46:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock
[2022-11-02 20:46:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock
[2022-11-02 20:46:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error
[2022-11-02 20:46:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error
[2022-11-02 20:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull
[2022-11-02 20:46:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull
[2022-11-02 20:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect
[2022-11-02 20:46:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect
[2022-11-02 20:46:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value
[2022-11-02 20:46:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value
[2022-11-02 20:46:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_irq_1
[2022-11-02 20:46:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_irq_1
[2022-11-02 20:46:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure st21nfca_hci_irq_thread_fn
[2022-11-02 20:46:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure st21nfca_hci_irq_thread_fn
[2022-11-02 20:46:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-11-02 20:46:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-11-02 20:46:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_to_desc
[2022-11-02 20:46:28,669 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_to_desc
[2022-11-02 20:46:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure nfc_hci_recv_frame
[2022-11-02 20:46:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure nfc_hci_recv_frame
[2022-11-02 20:46:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-11-02 20:46:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:46:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-02 20:46:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-11-02 20:46:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_send
[2022-11-02 20:46:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_send
[2022-11-02 20:46:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1
[2022-11-02 20:46:28,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1
[2022-11-02 20:46:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_2
[2022-11-02 20:46:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_2
[2022-11-02 20:46:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt
[2022-11-02 20:46:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt
[2022-11-02 20:46:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-11-02 20:46:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-02 20:46:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2022-11-02 20:46:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure st21nfca_hci_i2c_disable
[2022-11-02 20:46:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure st21nfca_hci_i2c_disable
[2022-11-02 20:46:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put
[2022-11-02 20:46:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put
[2022-11-02 20:46:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv
[2022-11-02 20:46:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv
[2022-11-02 20:46:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested
[2022-11-02 20:46:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested
[2022-11-02 20:46:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:46:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int
[2022-11-02 20:46:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc
[2022-11-02 20:46:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc
[2022-11-02 20:46:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:46:28,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:46:29,345 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:46:29,353 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:46:29,688 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true;
[2022-11-02 20:46:32,926 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:46:32,939 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:46:32,939 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-02 20:46:32,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:32 BoogieIcfgContainer
[2022-11-02 20:46:32,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:46:32,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:46:32,946 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:46:32,955 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:46:32,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:46:26" (1/3) ...
[2022-11-02 20:46:32,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5f8064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:32, skipping insertion in model container
[2022-11-02 20:46:32,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:28" (2/3) ...
[2022-11-02 20:46:32,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5f8064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:32, skipping insertion in model container
[2022-11-02 20:46:32,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:32" (3/3) ...
[2022-11-02 20:46:32,959 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i
[2022-11-02 20:46:32,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:46:32,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:46:33,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:46:33,094 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78c83a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:46:33,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:46:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 519 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 401 states have internal predecessors, (534), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89)
[2022-11-02 20:46:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2022-11-02 20:46:33,139 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:33,140 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:33,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2015835538, now seen corresponding path program 1 times
[2022-11-02 20:46:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:33,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980629637]
[2022-11-02 20:46:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2022-11-02 20:46:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:34,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:34,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980629637]
[2022-11-02 20:46:34,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980629637] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:34,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:34,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145379512]
[2022-11-02 20:46:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:34,269 INFO L87 Difference]: Start difference. First operand has 519 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 401 states have internal predecessors, (534), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:37,044 INFO L93 Difference]: Finished difference Result 1595 states and 2309 transitions.
[2022-11-02 20:46:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:46:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70
[2022-11-02 20:46:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:37,067 INFO L225 Difference]: With dead ends: 1595
[2022-11-02 20:46:37,067 INFO L226 Difference]: Without dead ends: 1047
[2022-11-02 20:46:37,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:46:37,079 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 900 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:37,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2854 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2022-11-02 20:46:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states.
[2022-11-02 20:46:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 982.
[2022-11-02 20:46:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 749 states have (on average 1.349799732977303) internal successors, (1011), 756 states have internal predecessors, (1011), 172 states have call successors, (172), 62 states have call predecessors, (172), 60 states have return successors, (171), 166 states have call predecessors, (171), 171 states have call successors, (171)
[2022-11-02 20:46:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1354 transitions.
[2022-11-02 20:46:37,213 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1354 transitions. Word has length 70
[2022-11-02 20:46:37,213 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:37,214 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1354 transitions.
[2022-11-02 20:46:37,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1354 transitions.
[2022-11-02 20:46:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2022-11-02 20:46:37,223 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:37,224 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:37,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:46:37,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -635011612, now seen corresponding path program 1 times
[2022-11-02 20:46:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092572283]
[2022-11-02 20:46:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2022-11-02 20:46:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:37,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092572283]
[2022-11-02 20:46:37,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092572283] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:37,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:37,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813551727]
[2022-11-02 20:46:37,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:37,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:37,771 INFO L87 Difference]: Start difference. First operand 982 states and 1354 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:39,951 INFO L93 Difference]: Finished difference Result 2234 states and 3105 transitions.
[2022-11-02 20:46:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:46:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71
[2022-11-02 20:46:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:39,968 INFO L225 Difference]: With dead ends: 2234
[2022-11-02 20:46:39,968 INFO L226 Difference]: Without dead ends: 1565
[2022-11-02 20:46:39,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:46:39,972 INFO L413 NwaCegarLoop]: 758 mSDtfsCounter, 869 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:39,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2729 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-11-02 20:46:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states.
[2022-11-02 20:46:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1469.
[2022-11-02 20:46:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1123 states have (on average 1.3490650044523598) internal successors, (1515), 1131 states have internal predecessors, (1515), 254 states have call successors, (254), 93 states have call predecessors, (254), 91 states have return successors, (254), 249 states have call predecessors, (254), 253 states have call successors, (254)
[2022-11-02 20:46:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2023 transitions.
[2022-11-02 20:46:40,118 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2023 transitions. Word has length 71
[2022-11-02 20:46:40,118 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:40,119 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2023 transitions.
[2022-11-02 20:46:40,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2023 transitions.
[2022-11-02 20:46:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2022-11-02 20:46:40,122 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:40,122 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:46:40,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1462134001, now seen corresponding path program 1 times
[2022-11-02 20:46:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770741623]
[2022-11-02 20:46:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2022-11-02 20:46:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770741623]
[2022-11-02 20:46:40,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770741623] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:40,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326398028]
[2022-11-02 20:46:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:40,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:40,492 INFO L87 Difference]: Start difference. First operand 1469 states and 2023 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:42,601 INFO L93 Difference]: Finished difference Result 3244 states and 4499 transitions.
[2022-11-02 20:46:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:46:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72
[2022-11-02 20:46:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:42,615 INFO L225 Difference]: With dead ends: 3244
[2022-11-02 20:46:42,616 INFO L226 Difference]: Without dead ends: 2087
[2022-11-02 20:46:42,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:46:42,626 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 872 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:42,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2734 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-11-02 20:46:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states.
[2022-11-02 20:46:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1962.
[2022-11-02 20:46:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1502 states have (on average 1.348202396804261) internal successors, (2025), 1511 states have internal predecessors, (2025), 336 states have call successors, (336), 125 states have call predecessors, (336), 123 states have return successors, (337), 332 states have call predecessors, (337), 335 states have call successors, (337)
[2022-11-02 20:46:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2698 transitions.
[2022-11-02 20:46:42,753 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2698 transitions. Word has length 72
[2022-11-02 20:46:42,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:42,755 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2698 transitions.
[2022-11-02 20:46:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2698 transitions.
[2022-11-02 20:46:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2022-11-02 20:46:42,759 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:42,759 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:42,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:46:42,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash 296125738, now seen corresponding path program 1 times
[2022-11-02 20:46:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:42,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522227503]
[2022-11-02 20:46:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2022-11-02 20:46:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:43,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522227503]
[2022-11-02 20:46:43,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522227503] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616044107]
[2022-11-02 20:46:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:43,092 INFO L87 Difference]: Start difference. First operand 1962 states and 2698 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:45,581 INFO L93 Difference]: Finished difference Result 6112 states and 8483 transitions.
[2022-11-02 20:46:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:46:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73
[2022-11-02 20:46:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:45,606 INFO L225 Difference]: With dead ends: 6112
[2022-11-02 20:46:45,606 INFO L226 Difference]: Without dead ends: 4163
[2022-11-02 20:46:45,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:46:45,623 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 886 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:45,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 2722 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2022-11-02 20:46:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states.
[2022-11-02 20:46:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 3912.
[2022-11-02 20:46:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 2995 states have (on average 1.3492487479131887) internal successors, (4041), 3029 states have internal predecessors, (4041), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669)
[2022-11-02 20:46:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5376 transitions.
[2022-11-02 20:46:45,899 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5376 transitions. Word has length 73
[2022-11-02 20:46:45,900 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:45,901 INFO L495 AbstractCegarLoop]: Abstraction has 3912 states and 5376 transitions.
[2022-11-02 20:46:45,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5376 transitions.
[2022-11-02 20:46:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-11-02 20:46:45,905 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:45,906 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:45,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:46:45,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -930834461, now seen corresponding path program 1 times
[2022-11-02 20:46:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064022216]
[2022-11-02 20:46:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52
[2022-11-02 20:46:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:46,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:46,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064022216]
[2022-11-02 20:46:46,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064022216] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:46,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:46,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066961965]
[2022-11-02 20:46:46,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:46,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:46,221 INFO L87 Difference]: Start difference. First operand 3912 states and 5376 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:48,024 INFO L93 Difference]: Finished difference Result 6857 states and 9449 transitions.
[2022-11-02 20:46:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-02 20:46:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74
[2022-11-02 20:46:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:48,049 INFO L225 Difference]: With dead ends: 6857
[2022-11-02 20:46:48,049 INFO L226 Difference]: Without dead ends: 4184
[2022-11-02 20:46:48,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:46:48,063 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 753 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:48,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2063 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-11-02 20:46:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states.
[2022-11-02 20:46:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3928.
[2022-11-02 20:46:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3011 states have (on average 1.347392892726669) internal successors, (4057), 3041 states have internal predecessors, (4057), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665)
[2022-11-02 20:46:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5384 transitions.
[2022-11-02 20:46:48,333 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5384 transitions. Word has length 74
[2022-11-02 20:46:48,334 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:48,334 INFO L495 AbstractCegarLoop]: Abstraction has 3928 states and 5384 transitions.
[2022-11-02 20:46:48,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5384 transitions.
[2022-11-02 20:46:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-11-02 20:46:48,337 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:48,337 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:46:48,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1929381901, now seen corresponding path program 1 times
[2022-11-02 20:46:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59657924]
[2022-11-02 20:46:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2022-11-02 20:46:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:48,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:48,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59657924]
[2022-11-02 20:46:48,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59657924] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:48,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:48,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374284594]
[2022-11-02 20:46:48,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:48,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:48,601 INFO L87 Difference]: Start difference. First operand 3928 states and 5384 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:50,344 INFO L93 Difference]: Finished difference Result 6893 states and 9457 transitions.
[2022-11-02 20:46:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-02 20:46:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75
[2022-11-02 20:46:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:50,367 INFO L225 Difference]: With dead ends: 6893
[2022-11-02 20:46:50,368 INFO L226 Difference]: Without dead ends: 4200
[2022-11-02 20:46:50,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:46:50,377 INFO L413 NwaCegarLoop]: 680 mSDtfsCounter, 751 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:50,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2067 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-11-02 20:46:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states.
[2022-11-02 20:46:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 3944.
[2022-11-02 20:46:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3053 states have internal predecessors, (4073), 658 states have call successors, (658), 261 states have call predecessors, (658), 258 states have return successors, (661), 643 states have call predecessors, (661), 657 states have call successors, (661)
[2022-11-02 20:46:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5392 transitions.
[2022-11-02 20:46:50,595 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5392 transitions. Word has length 75
[2022-11-02 20:46:50,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:50,596 INFO L495 AbstractCegarLoop]: Abstraction has 3944 states and 5392 transitions.
[2022-11-02 20:46:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5392 transitions.
[2022-11-02 20:46:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2022-11-02 20:46:50,608 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:50,608 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:50,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:46:50,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -4551865, now seen corresponding path program 1 times
[2022-11-02 20:46:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:50,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661304284]
[2022-11-02 20:46:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2022-11-02 20:46:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:50,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:50,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661304284]
[2022-11-02 20:46:50,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661304284] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:50,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:50,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524065]
[2022-11-02 20:46:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:50,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:50,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:50,873 INFO L87 Difference]: Start difference. First operand 3944 states and 5392 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:53,150 INFO L93 Difference]: Finished difference Result 8538 states and 11730 transitions.
[2022-11-02 20:46:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:46:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73
[2022-11-02 20:46:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:53,182 INFO L225 Difference]: With dead ends: 8538
[2022-11-02 20:46:53,183 INFO L226 Difference]: Without dead ends: 5212
[2022-11-02 20:46:53,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-11-02 20:46:53,197 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 873 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:53,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 2720 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-11-02 20:46:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states.
[2022-11-02 20:46:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4917.
[2022-11-02 20:46:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4917 states, 3773 states have (on average 1.3434932414524252) internal successors, (5069), 3803 states have internal predecessors, (5069), 818 states have call successors, (818), 328 states have call predecessors, (818), 325 states have return successors, (823), 803 states have call predecessors, (823), 817 states have call successors, (823)
[2022-11-02 20:46:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 6710 transitions.
[2022-11-02 20:46:53,519 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 6710 transitions. Word has length 73
[2022-11-02 20:46:53,519 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:53,520 INFO L495 AbstractCegarLoop]: Abstraction has 4917 states and 6710 transitions.
[2022-11-02 20:46:53,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 6710 transitions.
[2022-11-02 20:46:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-11-02 20:46:53,523 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:53,523 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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]
[2022-11-02 20:46:53,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:46:53,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 28640205, now seen corresponding path program 1 times
[2022-11-02 20:46:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055868677]
[2022-11-02 20:46:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2022-11-02 20:46:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2022-11-02 20:46:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2022-11-02 20:46:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2022-11-02 20:46:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055868677]
[2022-11-02 20:46:53,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055868677] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:53,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:53,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:46:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890945035]
[2022-11-02 20:46:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:53,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:46:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:53,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:46:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:46:53,712 INFO L87 Difference]: Start difference. First operand 4917 states and 6710 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:46:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:55,603 INFO L93 Difference]: Finished difference Result 13792 states and 18852 transitions.
[2022-11-02 20:46:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-02 20:46:55,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75
[2022-11-02 20:46:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:55,643 INFO L225 Difference]: With dead ends: 13792
[2022-11-02 20:46:55,644 INFO L226 Difference]: Without dead ends: 8888
[2022-11-02 20:46:55,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:46:55,656 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 888 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:55,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1635 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-11-02 20:46:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states.
[2022-11-02 20:46:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8321.
[2022-11-02 20:46:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8321 states, 6356 states have (on average 1.343455003146633) internal successors, (8539), 6398 states have internal predecessors, (8539), 1381 states have call successors, (1381), 586 states have call predecessors, (1381), 583 states have return successors, (1386), 1354 states have call predecessors, (1386), 1380 states have call successors, (1386)
[2022-11-02 20:46:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8321 states to 8321 states and 11306 transitions.
[2022-11-02 20:46:56,199 INFO L78 Accepts]: Start accepts. Automaton has 8321 states and 11306 transitions. Word has length 75
[2022-11-02 20:46:56,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 8321 states and 11306 transitions.
[2022-11-02 20:46:56,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2022-11-02 20:46:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 8321 states and 11306 transitions.
[2022-11-02 20:46:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-11-02 20:46:56,205 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:56,205 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:56,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:46:56,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1651914522, now seen corresponding path program 1 times
[2022-11-02 20:46:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990186871]
[2022-11-02 20:46:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2022-11-02 20:46:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-11-02 20:46:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:56,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990186871]
[2022-11-02 20:46:56,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990186871] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:46:56,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:46:56,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 20:46:56,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584859543]
[2022-11-02 20:46:56,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:46:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:46:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:46:56,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:46:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:46:56,478 INFO L87 Difference]: Start difference. First operand 8321 states and 11306 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:46:58,615 INFO L93 Difference]: Finished difference Result 14499 states and 19646 transitions.
[2022-11-02 20:46:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-02 20:46:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76
[2022-11-02 20:46:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:46:58,656 INFO L225 Difference]: With dead ends: 14499
[2022-11-02 20:46:58,656 INFO L226 Difference]: Without dead ends: 8482
[2022-11-02 20:46:58,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:46:58,677 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 749 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-11-02 20:46:58,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 2059 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-11-02 20:46:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8482 states.
[2022-11-02 20:46:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8482 to 7957.
[2022-11-02 20:46:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7957 states, 6070 states have (on average 1.3355848434925865) internal successors, (8107), 6102 states have internal predecessors, (8107), 1310 states have call successors, (1310), 579 states have call predecessors, (1310), 576 states have return successors, (1315), 1293 states have call predecessors, (1315), 1309 states have call successors, (1315)
[2022-11-02 20:46:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7957 states to 7957 states and 10732 transitions.
[2022-11-02 20:46:59,247 INFO L78 Accepts]: Start accepts. Automaton has 7957 states and 10732 transitions. Word has length 76
[2022-11-02 20:46:59,248 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:46:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 7957 states and 10732 transitions.
[2022-11-02 20:46:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2022-11-02 20:46:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7957 states and 10732 transitions.
[2022-11-02 20:46:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2022-11-02 20:46:59,252 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:46:59,252 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:46:59,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:46:59,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:46:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:46:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash 774234964, now seen corresponding path program 1 times
[2022-11-02 20:46:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:46:59,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061307782]
[2022-11-02 20:46:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:46:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:46:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:46:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:46:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:46:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:46:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2022-11-02 20:46:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2022-11-02 20:46:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:46:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-11-02 20:46:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:46:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061307782]
[2022-11-02 20:46:59,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061307782] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:46:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870915047]
[2022-11-02 20:46:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:46:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:46:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:46:59,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:46:59,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-11-02 20:47:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:00,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:47:00,161 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2022-11-02 20:47:00,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:00,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870915047] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:00,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:00,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10
[2022-11-02 20:47:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479622624]
[2022-11-02 20:47:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:00,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:00,191 INFO L87 Difference]: Start difference. First operand 7957 states and 10732 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2022-11-02 20:47:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:00,673 INFO L93 Difference]: Finished difference Result 15409 states and 20903 transitions.
[2022-11-02 20:47:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:00,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83
[2022-11-02 20:47:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:00,709 INFO L225 Difference]: With dead ends: 15409
[2022-11-02 20:47:00,709 INFO L226 Difference]: Without dead ends: 7975
[2022-11-02 20:47:00,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:00,731 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:00,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1376 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states.
[2022-11-02 20:47:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 7975.
[2022-11-02 20:47:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7975 states, 6088 states have (on average 1.3345926412614981) internal successors, (8125), 6120 states have internal predecessors, (8125), 1310 states have call successors, (1310), 579 states have call predecessors, (1310), 576 states have return successors, (1315), 1293 states have call predecessors, (1315), 1309 states have call successors, (1315)
[2022-11-02 20:47:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7975 states to 7975 states and 10750 transitions.
[2022-11-02 20:47:01,224 INFO L78 Accepts]: Start accepts. Automaton has 7975 states and 10750 transitions. Word has length 83
[2022-11-02 20:47:01,224 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:01,225 INFO L495 AbstractCegarLoop]: Abstraction has 7975 states and 10750 transitions.
[2022-11-02 20:47:01,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2022-11-02 20:47:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7975 states and 10750 transitions.
[2022-11-02 20:47:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2022-11-02 20:47:01,228 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:01,228 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:01,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:01,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-11-02 20:47:01,443 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 640221458, now seen corresponding path program 1 times
[2022-11-02 20:47:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:01,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904900589]
[2022-11-02 20:47:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2022-11-02 20:47:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-11-02 20:47:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-11-02 20:47:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2022-11-02 20:47:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2022-11-02 20:47:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2022-11-02 20:47:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2022-11-02 20:47:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-11-02 20:47:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904900589]
[2022-11-02 20:47:01,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904900589] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:47:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128974240]
[2022-11-02 20:47:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:01,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:47:01,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-11-02 20:47:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:02,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-11-02 20:47:02,348 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:47:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2022-11-02 20:47:02,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:47:02,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128974240] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:02,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:47:02,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10
[2022-11-02 20:47:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284272975]
[2022-11-02 20:47:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:02,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:02,495 INFO L87 Difference]: Start difference. First operand 7975 states and 10750 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2022-11-02 20:47:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:02,987 INFO L93 Difference]: Finished difference Result 7975 states and 10750 transitions.
[2022-11-02 20:47:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83
[2022-11-02 20:47:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:02,989 INFO L225 Difference]: With dead ends: 7975
[2022-11-02 20:47:02,989 INFO L226 Difference]: Without dead ends: 0
[2022-11-02 20:47:03,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:47:03,011 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 627 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:03,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 687 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:47:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-11-02 20:47:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-11-02 20:47:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-11-02 20:47:03,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83
[2022-11-02 20:47:03,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:03,015 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-11-02 20:47:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2022-11-02 20:47:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-11-02 20:47:03,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-11-02 20:47:03,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-02 20:47:03,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-11-02 20:47:03,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:47:03,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-11-02 20:47:28,119 INFO L902 garLoopResultBuilder]: At program point print_hex_dumpENTRY(lines 4554 4556) the Hoare annotation is: true
[2022-11-02 20:47:28,119 INFO L899 garLoopResultBuilder]: For program point print_hex_dumpFINAL(lines 4554 4556) no Hoare annotation was computed.
[2022-11-02 20:47:28,120 INFO L899 garLoopResultBuilder]: For program point print_hex_dumpEXIT(lines 4554 4556) no Hoare annotation was computed.
[2022-11-02 20:47:28,120 INFO L899 garLoopResultBuilder]: For program point usleep_rangeFINAL(lines 4592 4594) no Hoare annotation was computed.
[2022-11-02 20:47:28,120 INFO L899 garLoopResultBuilder]: For program point usleep_rangeEXIT(lines 4592 4594) no Hoare annotation was computed.
[2022-11-02 20:47:28,120 INFO L902 garLoopResultBuilder]: At program point usleep_rangeENTRY(lines 4592 4594) the Hoare annotation is: true
[2022-11-02 20:47:28,120 INFO L899 garLoopResultBuilder]: For program point devm_gpio_requestEXIT(lines 4479 4481) no Hoare annotation was computed.
[2022-11-02 20:47:28,120 INFO L899 garLoopResultBuilder]: For program point devm_gpio_requestFINAL(lines 4479 4481) no Hoare annotation was computed.
[2022-11-02 20:47:28,121 INFO L902 garLoopResultBuilder]: At program point devm_gpio_requestENTRY(lines 4479 4481) the Hoare annotation is: true
[2022-11-02 20:47:28,121 INFO L899 garLoopResultBuilder]: For program point msleepEXIT(lines 4542 4544) no Hoare annotation was computed.
[2022-11-02 20:47:28,121 INFO L902 garLoopResultBuilder]: At program point msleepENTRY(lines 4542 4544) the Hoare annotation is: true
[2022-11-02 20:47:28,121 INFO L899 garLoopResultBuilder]: For program point msleepFINAL(lines 4542 4544) no Hoare annotation was computed.
[2022-11-02 20:47:28,121 INFO L899 garLoopResultBuilder]: For program point st21nfca_hci_i2c_disableEXIT(lines 3204 3214) no Hoare annotation was computed.
[2022-11-02 20:47:28,121 INFO L895 garLoopResultBuilder]: At program point L3210(line 3210) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)))
[2022-11-02 20:47:28,122 INFO L899 garLoopResultBuilder]: For program point L3210-1(line 3210) no Hoare annotation was computed.
[2022-11-02 20:47:28,122 INFO L899 garLoopResultBuilder]: For program point st21nfca_hci_i2c_disableFINAL(lines 3204 3214) no Hoare annotation was computed.
[2022-11-02 20:47:28,122 INFO L895 garLoopResultBuilder]: At program point st21nfca_hci_i2c_disableENTRY(lines 3204 3214) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)))
[2022-11-02 20:47:28,122 INFO L895 garLoopResultBuilder]: At program point skb_putENTRY(lines 4577 4581) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)))
[2022-11-02 20:47:28,122 INFO L899 garLoopResultBuilder]: For program point skb_putFINAL(lines 4577 4581) no Hoare annotation was computed.
[2022-11-02 20:47:28,122 INFO L899 garLoopResultBuilder]: For program point skb_putEXIT(lines 4577 4581) no Hoare annotation was computed.
[2022-11-02 20:47:28,123 INFO L899 garLoopResultBuilder]: For program point i2c_master_sendEXIT(lines 4512 4514) no Hoare annotation was computed.
[2022-11-02 20:47:28,123 INFO L902 garLoopResultBuilder]: At program point i2c_master_sendENTRY(lines 4512 4514) the Hoare annotation is: true
[2022-11-02 20:47:28,123 INFO L899 garLoopResultBuilder]: For program point i2c_master_sendFINAL(lines 4512 4514) no Hoare annotation was computed.
[2022-11-02 20:47:28,123 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 4548 4550) the Hoare annotation is: true
[2022-11-02 20:47:28,123 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 4548 4550) no Hoare annotation was computed.
[2022-11-02 20:47:28,123 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 4548 4550) no Hoare annotation was computed.
[2022-11-02 20:47:28,124 INFO L899 garLoopResultBuilder]: For program point i2c_master_recvFINAL(lines 4508 4510) no Hoare annotation was computed.
[2022-11-02 20:47:28,124 INFO L902 garLoopResultBuilder]: At program point i2c_master_recvENTRY(lines 4508 4510) the Hoare annotation is: true
[2022-11-02 20:47:28,124 INFO L899 garLoopResultBuilder]: For program point i2c_master_recvEXIT(lines 4508 4510) no Hoare annotation was computed.
[2022-11-02 20:47:28,124 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2864 2870) no Hoare annotation was computed.
[2022-11-02 20:47:28,124 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2864 2870) the Hoare annotation is: true
[2022-11-02 20:47:28,124 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2868) no Hoare annotation was computed.
[2022-11-02 20:47:28,125 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2864 2870) no Hoare annotation was computed.
[2022-11-02 20:47:28,125 INFO L899 garLoopResultBuilder]: For program point devm_request_threaded_irqFINAL(lines 4486 4488) no Hoare annotation was computed.
[2022-11-02 20:47:28,125 INFO L902 garLoopResultBuilder]: At program point devm_request_threaded_irqENTRY(lines 4486 4488) the Hoare annotation is: true
[2022-11-02 20:47:28,125 INFO L899 garLoopResultBuilder]: For program point devm_request_threaded_irqEXIT(lines 4486 4488) no Hoare annotation was computed.
[2022-11-02 20:47:28,125 INFO L899 garLoopResultBuilder]: For program point L3968(lines 3968 3996) no Hoare annotation was computed.
[2022-11-02 20:47:28,125 INFO L899 garLoopResultBuilder]: For program point L3966(lines 3966 3999) no Hoare annotation was computed.
[2022-11-02 20:47:28,126 INFO L895 garLoopResultBuilder]: At program point L3966-1(lines 3966 3999) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or (= |ldv_irq_1_~state#1| 0) .cse0 .cse1 (not (= |ldv_irq_1_#in~state#1| 0)) .cse2 .cse3 (not (= ~ldv_irq_1_3~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))))
[2022-11-02 20:47:28,126 INFO L895 garLoopResultBuilder]: At program point L3995(line 3995) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (or .cse0 .cse1 (not (= |ldv_irq_1_#in~state#1| 0)) .cse2 .cse3 (not (= ~ldv_irq_1_3~0 0)) (not (= ~ldv_irq_1_2~0 0)) (not (= ~ldv_irq_1_1~0 0)))))
[2022-11-02 20:47:28,126 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1FINAL(lines 3960 4002) no Hoare annotation was computed.
[2022-11-02 20:47:28,126 INFO L899 garLoopResultBuilder]: For program point L3989-1(line 3989) no Hoare annotation was computed.
[2022-11-02 20:47:28,126 INFO L895 garLoopResultBuilder]: At program point L4530(lines 4529 4531) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 (not (= |ldv_irq_1_#in~state#1| 0)) .cse2 .cse3 (not (= ~ldv_irq_1_3~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))))
[2022-11-02 20:47:28,127 INFO L895 garLoopResultBuilder]: At program point L3989(line 3989) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 (not (= |ldv_irq_1_#in~state#1| 0)) .cse2 .cse3 (not (= ~ldv_irq_1_3~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))))
[2022-11-02 20:47:28,127 INFO L899 garLoopResultBuilder]: For program point L3987(line 3987) no Hoare annotation was computed.
[2022-11-02 20:47:28,127 INFO L895 garLoopResultBuilder]: At program point ldv_irq_1ENTRY(lines 3960 4002) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,127 INFO L899 garLoopResultBuilder]: For program point L3979-1(lines 3979 3982) no Hoare annotation was computed.
[2022-11-02 20:47:28,127 INFO L899 garLoopResultBuilder]: For program point L3975(lines 3975 3978) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1EXIT(lines 3960 4002) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L3975-2(lines 3970 3984) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L3969(line 3969) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L3994(line 3994) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L3988(lines 3988 3992) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L3970(lines 3970 3985) no Hoare annotation was computed.
[2022-11-02 20:47:28,128 INFO L899 garLoopResultBuilder]: For program point L4572-1(line 4572) no Hoare annotation was computed.
[2022-11-02 20:47:28,129 INFO L895 garLoopResultBuilder]: At program point skb_pullENTRY(lines 4571 4573) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,129 INFO L899 garLoopResultBuilder]: For program point skb_pullFINAL(lines 4571 4573) no Hoare annotation was computed.
[2022-11-02 20:47:28,129 INFO L895 garLoopResultBuilder]: At program point L4572(line 4572) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,129 INFO L899 garLoopResultBuilder]: For program point skb_pullEXIT(lines 4571 4573) no Hoare annotation was computed.
[2022-11-02 20:47:28,129 INFO L902 garLoopResultBuilder]: At program point L4447(lines 4440 4448) the Hoare annotation is: true
[2022-11-02 20:47:28,129 INFO L902 garLoopResultBuilder]: At program point L4443(line 4443) the Hoare annotation is: true
[2022-11-02 20:47:28,130 INFO L895 garLoopResultBuilder]: At program point alloc_skbENTRY(lines 4270 4278) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,130 INFO L899 garLoopResultBuilder]: For program point L4442(lines 4442 4446) no Hoare annotation was computed.
[2022-11-02 20:47:28,130 INFO L899 garLoopResultBuilder]: For program point L4443-1(line 4443) no Hoare annotation was computed.
[2022-11-02 20:47:28,130 INFO L895 garLoopResultBuilder]: At program point L4441(line 4441) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,130 INFO L899 garLoopResultBuilder]: For program point L4441-1(line 4441) no Hoare annotation was computed.
[2022-11-02 20:47:28,130 INFO L899 garLoopResultBuilder]: For program point L4442-2(lines 4442 4446) no Hoare annotation was computed.
[2022-11-02 20:47:28,131 INFO L895 garLoopResultBuilder]: At program point L4274(line 4274) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,131 INFO L899 garLoopResultBuilder]: For program point L4274-1(line 4274) no Hoare annotation was computed.
[2022-11-02 20:47:28,131 INFO L899 garLoopResultBuilder]: For program point alloc_skbFINAL(lines 4270 4278) no Hoare annotation was computed.
[2022-11-02 20:47:28,131 INFO L902 garLoopResultBuilder]: At program point L3082(lines 3077 3084) the Hoare annotation is: true
[2022-11-02 20:47:28,131 INFO L899 garLoopResultBuilder]: For program point alloc_skbEXIT(lines 4270 4278) no Hoare annotation was computed.
[2022-11-02 20:47:28,132 INFO L895 garLoopResultBuilder]: At program point L4032(line 4032) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (or .cse0 .cse1 .cse2 (not (= |ldv_irq_2_#in~state#1| 0)) .cse3)))
[2022-11-02 20:47:28,132 INFO L899 garLoopResultBuilder]: For program point L4030(line 4030) no Hoare annotation was computed.
[2022-11-02 20:47:28,132 INFO L899 garLoopResultBuilder]: For program point L4032-1(line 4032) no Hoare annotation was computed.
[2022-11-02 20:47:28,132 INFO L895 garLoopResultBuilder]: At program point L4534(lines 4533 4535) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (or .cse0 .cse1 .cse2 (not (= |ldv_irq_2_#in~state#1| 0)) .cse3)))
[2022-11-02 20:47:28,132 INFO L899 garLoopResultBuilder]: For program point L4022-1(lines 4022 4025) no Hoare annotation was computed.
[2022-11-02 20:47:28,132 INFO L899 garLoopResultBuilder]: For program point L4018(lines 4018 4021) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L899 garLoopResultBuilder]: For program point L4018-2(lines 4013 4027) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L899 garLoopResultBuilder]: For program point L4012(line 4012) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L899 garLoopResultBuilder]: For program point L4037(line 4037) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L899 garLoopResultBuilder]: For program point L4031(lines 4031 4035) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L899 garLoopResultBuilder]: For program point ldv_irq_2FINAL(lines 4003 4045) no Hoare annotation was computed.
[2022-11-02 20:47:28,133 INFO L895 garLoopResultBuilder]: At program point ldv_irq_2ENTRY(lines 4003 4045) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,134 INFO L899 garLoopResultBuilder]: For program point L4013(lines 4013 4028) no Hoare annotation was computed.
[2022-11-02 20:47:28,134 INFO L899 garLoopResultBuilder]: For program point L4011(lines 4011 4039) no Hoare annotation was computed.
[2022-11-02 20:47:28,134 INFO L895 garLoopResultBuilder]: At program point L4009-1(lines 4009 4042) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (= ~ldv_irq_2_1~0 0))) (.cse2 (not (= ~ldv_irq_2_2~0 0))) (.cse3 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (or .cse0 .cse1 .cse2 (not (= |ldv_irq_2_#in~state#1| 0)) .cse3 (= |ldv_irq_2_~state#1| 0))))
[2022-11-02 20:47:28,134 INFO L899 garLoopResultBuilder]: For program point L4009(lines 4009 4042) no Hoare annotation was computed.
[2022-11-02 20:47:28,134 INFO L895 garLoopResultBuilder]: At program point L4038(line 4038) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,134 INFO L899 garLoopResultBuilder]: For program point ldv_irq_2EXIT(lines 4003 4045) no Hoare annotation was computed.
[2022-11-02 20:47:28,135 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2871 2877) no Hoare annotation was computed.
[2022-11-02 20:47:28,135 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2871 2877) the Hoare annotation is: true
[2022-11-02 20:47:28,135 INFO L899 garLoopResultBuilder]: For program point crc_ccittEXIT(lines 4471 4473) no Hoare annotation was computed.
[2022-11-02 20:47:28,135 INFO L902 garLoopResultBuilder]: At program point crc_ccittENTRY(lines 4471 4473) the Hoare annotation is: true
[2022-11-02 20:47:28,135 INFO L899 garLoopResultBuilder]: For program point crc_ccittFINAL(lines 4471 4473) no Hoare annotation was computed.
[2022-11-02 20:47:28,135 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 2878 2883) no Hoare annotation was computed.
[2022-11-02 20:47:28,136 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 2878 2883) the Hoare annotation is: true
[2022-11-02 20:47:28,136 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 2878 2883) no Hoare annotation was computed.
[2022-11-02 20:47:28,136 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedFINAL(lines 4545 4547) no Hoare annotation was computed.
[2022-11-02 20:47:28,136 INFO L902 garLoopResultBuilder]: At program point mutex_lock_nestedENTRY(lines 4545 4547) the Hoare annotation is: true
[2022-11-02 20:47:28,136 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedEXIT(lines 4545 4547) no Hoare annotation was computed.
[2022-11-02 20:47:28,136 INFO L902 garLoopResultBuilder]: At program point gpio_set_valueENTRY(lines 3043 3049) the Hoare annotation is: true
[2022-11-02 20:47:28,136 INFO L899 garLoopResultBuilder]: For program point gpio_set_valueEXIT(lines 3043 3049) no Hoare annotation was computed.
[2022-11-02 20:47:28,137 INFO L899 garLoopResultBuilder]: For program point gpio_set_valueFINAL(lines 3043 3049) no Hoare annotation was computed.
[2022-11-02 20:47:28,137 INFO L902 garLoopResultBuilder]: At program point L3030(lines 3027 3032) the Hoare annotation is: true
[2022-11-02 20:47:28,137 INFO L895 garLoopResultBuilder]: At program point L4575(line 4575) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,137 INFO L899 garLoopResultBuilder]: For program point skb_pushFINAL(lines 4574 4576) no Hoare annotation was computed.
[2022-11-02 20:47:28,137 INFO L899 garLoopResultBuilder]: For program point L4575-1(line 4575) no Hoare annotation was computed.
[2022-11-02 20:47:28,137 INFO L895 garLoopResultBuilder]: At program point skb_pushENTRY(lines 4574 4576) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,138 INFO L899 garLoopResultBuilder]: For program point skb_pushEXIT(lines 4574 4576) no Hoare annotation was computed.
[2022-11-02 20:47:28,138 INFO L899 garLoopResultBuilder]: For program point i2c_get_clientdataFINAL(lines 2970 2977) no Hoare annotation was computed.
[2022-11-02 20:47:28,138 INFO L902 garLoopResultBuilder]: At program point L2957(lines 2954 2959) the Hoare annotation is: true
[2022-11-02 20:47:28,138 INFO L899 garLoopResultBuilder]: For program point i2c_get_clientdataEXIT(lines 2970 2977) no Hoare annotation was computed.
[2022-11-02 20:47:28,138 INFO L902 garLoopResultBuilder]: At program point i2c_get_clientdataENTRY(lines 2970 2977) the Hoare annotation is: true
[2022-11-02 20:47:28,138 INFO L899 garLoopResultBuilder]: For program point reg_check_1EXIT(lines 3911 3921) no Hoare annotation was computed.
[2022-11-02 20:47:28,139 INFO L902 garLoopResultBuilder]: At program point reg_check_1ENTRY(lines 3911 3921) the Hoare annotation is: true
[2022-11-02 20:47:28,139 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed.
[2022-11-02 20:47:28,139 INFO L899 garLoopResultBuilder]: For program point reg_check_1FINAL(lines 3911 3921) no Hoare annotation was computed.
[2022-11-02 20:47:28,139 INFO L899 garLoopResultBuilder]: For program point L3933(lines 3933 3940) no Hoare annotation was computed.
[2022-11-02 20:47:28,139 INFO L899 garLoopResultBuilder]: For program point L3925(lines 3925 3932) no Hoare annotation was computed.
[2022-11-02 20:47:28,139 INFO L899 garLoopResultBuilder]: For program point activate_suitable_irq_1EXIT(lines 3922 3959) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L895 garLoopResultBuilder]: At program point activate_suitable_irq_1ENTRY(lines 3922 3959) the Hoare annotation is: (let ((.cse0 (not (= |old(~ldv_irq_1_2~0)| 0))) (.cse6 (not (= |old(~ldv_irq_1_1~0)| 0))) (.cse1 (not (= |old(~ldv_irq_1_3~0)| 0))) (.cse2 (not (= ~ldv_spin~0 0))) (.cse3 (not (= ~ldv_irq_2_1~0 0))) (.cse4 (not (= ~ldv_irq_2_2~0 0))) (.cse5 (not (= ~ldv_irq_2_3~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~ldv_irq_1_2~0 0)) (or .cse0 .cse1 (not (= |old(~ldv_irq_1_0~0)| 0)) .cse2 .cse3 .cse4 (= ~ldv_irq_1_0~0 0) .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~ldv_irq_1_1~0 0) .cse6) (or .cse1 .cse2 .cse3 (= ~ldv_irq_1_3~0 0) .cse4 .cse5)))
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point L3949(lines 3949 3956) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point activate_suitable_irq_1FINAL(lines 3922 3959) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point L3941(lines 3941 3948) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point L3405(lines 3405 3409) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point L3389(lines 3389 3394) no Hoare annotation was computed.
[2022-11-02 20:47:28,140 INFO L899 garLoopResultBuilder]: For program point L3389-2(lines 3389 3394) no Hoare annotation was computed.
[2022-11-02 20:47:28,141 INFO L902 garLoopResultBuilder]: At program point L3538(line 3538) the Hoare annotation is: true
[2022-11-02 20:47:28,141 INFO L899 garLoopResultBuilder]: For program point L3538-1(line 3538) no Hoare annotation was computed.
[2022-11-02 20:47:28,141 INFO L899 garLoopResultBuilder]: For program point L3439(line 3439) no Hoare annotation was computed.
[2022-11-02 20:47:28,141 INFO L899 garLoopResultBuilder]: For program point L3555(line 3555) no Hoare annotation was computed.
[2022-11-02 20:47:28,141 INFO L899 garLoopResultBuilder]: For program point L3456(line 3456) no Hoare annotation was computed.
[2022-11-02 20:47:28,141 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3465) no Hoare annotation was computed.
[2022-11-02 20:47:28,142 INFO L899 garLoopResultBuilder]: For program point L3357-1(line 3357) no Hoare annotation was computed.
[2022-11-02 20:47:28,142 INFO L902 garLoopResultBuilder]: At program point L3357(line 3357) the Hoare annotation is: true
[2022-11-02 20:47:28,142 INFO L902 garLoopResultBuilder]: At program point L4596(lines 4595 4597) the Hoare annotation is: true
[2022-11-02 20:47:28,142 INFO L899 garLoopResultBuilder]: For program point L3440(lines 3440 3443) no Hoare annotation was computed.
[2022-11-02 20:47:28,142 INFO L899 garLoopResultBuilder]: For program point L3440-2(lines 3440 3443) no Hoare annotation was computed.
[2022-11-02 20:47:28,142 INFO L899 garLoopResultBuilder]: For program point L3556(lines 3556 3560) no Hoare annotation was computed.
[2022-11-02 20:47:28,142 INFO L899 garLoopResultBuilder]: For program point L3556-2(lines 3556 3560) no Hoare annotation was computed.
[2022-11-02 20:47:28,143 INFO L899 garLoopResultBuilder]: For program point L3457-1(line 3457) no Hoare annotation was computed.
[2022-11-02 20:47:28,143 INFO L902 garLoopResultBuilder]: At program point L3457(line 3457) the Hoare annotation is: true
[2022-11-02 20:47:28,143 INFO L899 garLoopResultBuilder]: For program point L3441-1(line 3441) no Hoare annotation was computed.
[2022-11-02 20:47:28,143 INFO L902 garLoopResultBuilder]: At program point L3441(line 3441) the Hoare annotation is: true
[2022-11-02 20:47:28,143 INFO L899 garLoopResultBuilder]: For program point L3359(line 3359) no Hoare annotation was computed.
[2022-11-02 20:47:28,143 INFO L899 garLoopResultBuilder]: For program point L3359-2(lines 3359 3367) no Hoare annotation was computed.
[2022-11-02 20:47:28,144 INFO L899 garLoopResultBuilder]: For program point L3508(line 3508) no Hoare annotation was computed.
[2022-11-02 20:47:28,144 INFO L899 garLoopResultBuilder]: For program point L3541(lines 3541 3554) no Hoare annotation was computed.
[2022-11-02 20:47:28,144 INFO L902 garLoopResultBuilder]: At program point L3558(line 3558) the Hoare annotation is: true
[2022-11-02 20:47:28,144 INFO L899 garLoopResultBuilder]: For program point L3558-1(line 3558) no Hoare annotation was computed.
[2022-11-02 20:47:28,144 INFO L899 garLoopResultBuilder]: For program point L3509(lines 3509 3512) no Hoare annotation was computed.
[2022-11-02 20:47:28,144 INFO L902 garLoopResultBuilder]: At program point L3410(line 3410) the Hoare annotation is: true
[2022-11-02 20:47:28,144 INFO L899 garLoopResultBuilder]: For program point L3410-1(line 3410) no Hoare annotation was computed.
[2022-11-02 20:47:28,145 INFO L902 garLoopResultBuilder]: At program point L3526(line 3526) the Hoare annotation is: true
[2022-11-02 20:47:28,145 INFO L899 garLoopResultBuilder]: For program point L3526-1(line 3526) no Hoare annotation was computed.
[2022-11-02 20:47:28,145 INFO L895 garLoopResultBuilder]: At program point st21nfca_hci_irq_thread_fnENTRY(lines 3482 3563) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,145 INFO L899 garLoopResultBuilder]: For program point L3378(line 3378) no Hoare annotation was computed.
[2022-11-02 20:47:28,145 INFO L899 garLoopResultBuilder]: For program point L3411-1(line 3411) no Hoare annotation was computed.
[2022-11-02 20:47:28,145 INFO L902 garLoopResultBuilder]: At program point L3411(line 3411) the Hoare annotation is: true
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3378-2(line 3378) no Hoare annotation was computed.
[2022-11-02 20:47:28,146 INFO L902 garLoopResultBuilder]: At program point L3345(lines 3335 3351) the Hoare annotation is: true
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3378-4(line 3378) no Hoare annotation was computed.
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3378-5(lines 3378 3381) no Hoare annotation was computed.
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3527(lines 3527 3530) no Hoare annotation was computed.
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3461-1(line 3461) no Hoare annotation was computed.
[2022-11-02 20:47:28,146 INFO L899 garLoopResultBuilder]: For program point L3527-2(lines 3527 3530) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3461(line 3461) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3461-3(line 3461) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3461-5(lines 3461 3465) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3461-7(lines 3461 3465) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3544(line 3544) no Hoare annotation was computed.
[2022-11-02 20:47:28,147 INFO L899 garLoopResultBuilder]: For program point L3544-2(lines 3544 3554) no Hoare annotation was computed.
[2022-11-02 20:47:28,148 INFO L902 garLoopResultBuilder]: At program point L3445(lines 3432 3477) the Hoare annotation is: true
[2022-11-02 20:47:28,148 INFO L899 garLoopResultBuilder]: For program point L3346(line 3346) no Hoare annotation was computed.
[2022-11-02 20:47:28,148 INFO L899 garLoopResultBuilder]: For program point L3346-2(lines 3346 3349) no Hoare annotation was computed.
[2022-11-02 20:47:28,148 INFO L902 garLoopResultBuilder]: At program point L3462(line 3462) the Hoare annotation is: true
[2022-11-02 20:47:28,148 INFO L899 garLoopResultBuilder]: For program point L3462-1(line 3462) no Hoare annotation was computed.
[2022-11-02 20:47:28,148 INFO L899 garLoopResultBuilder]: For program point L3363-1(lines 3363 3364) no Hoare annotation was computed.
[2022-11-02 20:47:28,149 INFO L902 garLoopResultBuilder]: At program point L3363(lines 3363 3364) the Hoare annotation is: true
[2022-11-02 20:47:28,149 INFO L899 garLoopResultBuilder]: For program point L3545-1(line 3545) no Hoare annotation was computed.
[2022-11-02 20:47:28,149 INFO L902 garLoopResultBuilder]: At program point L3545(line 3545) the Hoare annotation is: true
[2022-11-02 20:47:28,149 INFO L902 garLoopResultBuilder]: At program point L3479(lines 3419 3481) the Hoare annotation is: true
[2022-11-02 20:47:28,149 INFO L902 garLoopResultBuilder]: At program point L3347(lines 3335 3351) the Hoare annotation is: true
[2022-11-02 20:47:28,149 INFO L902 garLoopResultBuilder]: At program point L4520(lines 4519 4521) the Hoare annotation is: true
[2022-11-02 20:47:28,150 INFO L902 garLoopResultBuilder]: At program point L3397(lines 3383 3413) the Hoare annotation is: true
[2022-11-02 20:47:28,150 INFO L902 garLoopResultBuilder]: At program point L3447(lines 3432 3477) the Hoare annotation is: true
[2022-11-02 20:47:28,150 INFO L899 garLoopResultBuilder]: For program point L3497(line 3497) no Hoare annotation was computed.
[2022-11-02 20:47:28,150 INFO L899 garLoopResultBuilder]: For program point L3398(lines 3398 3401) no Hoare annotation was computed.
[2022-11-02 20:47:28,150 INFO L899 garLoopResultBuilder]: For program point L3497-2(lines 3497 3518) no Hoare annotation was computed.
[2022-11-02 20:47:28,150 INFO L902 garLoopResultBuilder]: At program point L3415(lines 3371 3417) the Hoare annotation is: true
[2022-11-02 20:47:28,151 INFO L899 garLoopResultBuilder]: For program point L3531(lines 3531 3534) no Hoare annotation was computed.
[2022-11-02 20:47:28,151 INFO L899 garLoopResultBuilder]: For program point L3432(lines 3432 3478) no Hoare annotation was computed.
[2022-11-02 20:47:28,151 INFO L902 garLoopResultBuilder]: At program point L3399(lines 3383 3413) the Hoare annotation is: true
[2022-11-02 20:47:28,151 INFO L899 garLoopResultBuilder]: For program point L3515(line 3515) no Hoare annotation was computed.
[2022-11-02 20:47:28,151 INFO L902 garLoopResultBuilder]: At program point L3350(lines 3332 3352) the Hoare annotation is: true
[2022-11-02 20:47:28,151 INFO L899 garLoopResultBuilder]: For program point L3383(lines 3383 3414) no Hoare annotation was computed.
[2022-11-02 20:47:28,151 INFO L899 garLoopResultBuilder]: For program point L3499-1(line 3499) no Hoare annotation was computed.
[2022-11-02 20:47:28,152 INFO L902 garLoopResultBuilder]: At program point L3499(line 3499) the Hoare annotation is: true
[2022-11-02 20:47:28,152 INFO L902 garLoopResultBuilder]: At program point L3450(line 3450) the Hoare annotation is: true
[2022-11-02 20:47:28,152 INFO L902 garLoopResultBuilder]: At program point L3384(line 3384) the Hoare annotation is: true
[2022-11-02 20:47:28,152 INFO L899 garLoopResultBuilder]: For program point L3450-1(lines 3432 3477) no Hoare annotation was computed.
[2022-11-02 20:47:28,152 INFO L899 garLoopResultBuilder]: For program point L3384-1(line 3384) no Hoare annotation was computed.
[2022-11-02 20:47:28,152 INFO L899 garLoopResultBuilder]: For program point L3500(lines 3500 3514) no Hoare annotation was computed.
[2022-11-02 20:47:28,152 INFO L899 garLoopResultBuilder]: For program point L3467-1(line 3467) no Hoare annotation was computed.
[2022-11-02 20:47:28,153 INFO L902 garLoopResultBuilder]: At program point L3500-1(lines 3500 3514) the Hoare annotation is: true
[2022-11-02 20:47:28,153 INFO L902 garLoopResultBuilder]: At program point L3467(line 3467) the Hoare annotation is: true
[2022-11-02 20:47:28,153 INFO L902 garLoopResultBuilder]: At program point L3368(lines 3353 3370) the Hoare annotation is: true
[2022-11-02 20:47:28,153 INFO L899 garLoopResultBuilder]: For program point L3550(lines 3550 3554) no Hoare annotation was computed.
[2022-11-02 20:47:28,153 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true
[2022-11-02 20:47:28,153 INFO L902 garLoopResultBuilder]: At program point L3550-2(lines 3544 3554) the Hoare annotation is: true
[2022-11-02 20:47:28,154 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true
[2022-11-02 20:47:28,154 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,154 INFO L899 garLoopResultBuilder]: For program point st21nfca_hci_irq_thread_fnEXIT(lines 3482 3563) no Hoare annotation was computed.
[2022-11-02 20:47:28,154 INFO L899 garLoopResultBuilder]: For program point L3435-1(line 3435) no Hoare annotation was computed.
[2022-11-02 20:47:28,154 INFO L902 garLoopResultBuilder]: At program point L3402(line 3402) the Hoare annotation is: true
[2022-11-02 20:47:28,154 INFO L902 garLoopResultBuilder]: At program point L3435(line 3435) the Hoare annotation is: true
[2022-11-02 20:47:28,154 INFO L902 garLoopResultBuilder]: At program point L3402-1(line 3402) the Hoare annotation is: true
[2022-11-02 20:47:28,155 INFO L899 garLoopResultBuilder]: For program point L3551-1(line 3551) no Hoare annotation was computed.
[2022-11-02 20:47:28,155 INFO L902 garLoopResultBuilder]: At program point L3551(line 3551) the Hoare annotation is: true
[2022-11-02 20:47:28,155 INFO L902 garLoopResultBuilder]: At program point L3502(line 3502) the Hoare annotation is: true
[2022-11-02 20:47:28,155 INFO L899 garLoopResultBuilder]: For program point st21nfca_hci_irq_thread_fnFINAL(lines 3482 3563) no Hoare annotation was computed.
[2022-11-02 20:47:28,155 INFO L899 garLoopResultBuilder]: For program point L3502-1(line 3502) no Hoare annotation was computed.
[2022-11-02 20:47:28,155 INFO L899 garLoopResultBuilder]: For program point L3469(lines 3469 3474) no Hoare annotation was computed.
[2022-11-02 20:47:28,156 INFO L899 garLoopResultBuilder]: For program point L3403(line 3403) no Hoare annotation was computed.
[2022-11-02 20:47:28,156 INFO L899 garLoopResultBuilder]: For program point L3337(lines 3337 3340) no Hoare annotation was computed.
[2022-11-02 20:47:28,156 INFO L899 garLoopResultBuilder]: For program point L3536(lines 3536 3554) no Hoare annotation was computed.
[2022-11-02 20:47:28,156 INFO L899 garLoopResultBuilder]: For program point L3503(lines 3503 3507) no Hoare annotation was computed.
[2022-11-02 20:47:28,156 INFO L902 garLoopResultBuilder]: At program point L3503-2(lines 3503 3507) the Hoare annotation is: true
[2022-11-02 20:47:28,156 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 2811 2813) the Hoare annotation is: true
[2022-11-02 20:47:28,156 INFO L899 garLoopResultBuilder]: For program point L2812(line 2812) no Hoare annotation was computed.
[2022-11-02 20:47:28,157 INFO L899 garLoopResultBuilder]: For program point L2812-2(lines 2811 2813) no Hoare annotation was computed.
[2022-11-02 20:47:28,157 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 2811 2813) no Hoare annotation was computed.
[2022-11-02 20:47:28,157 INFO L899 garLoopResultBuilder]: For program point gpio_to_descFINAL(lines 4489 4491) no Hoare annotation was computed.
[2022-11-02 20:47:28,157 INFO L895 garLoopResultBuilder]: At program point L4490(line 4490) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,157 INFO L895 garLoopResultBuilder]: At program point gpio_to_descENTRY(lines 4489 4491) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,157 INFO L899 garLoopResultBuilder]: For program point L4490-1(line 4490) no Hoare annotation was computed.
[2022-11-02 20:47:28,158 INFO L899 garLoopResultBuilder]: For program point gpio_to_descEXIT(lines 4489 4491) no Hoare annotation was computed.
[2022-11-02 20:47:28,158 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 2814 2830) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,158 INFO L902 garLoopResultBuilder]: At program point L2826(line 2826) the Hoare annotation is: true
[2022-11-02 20:47:28,158 INFO L899 garLoopResultBuilder]: For program point L2826-1(line 2826) no Hoare annotation was computed.
[2022-11-02 20:47:28,158 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 2814 2830) no Hoare annotation was computed.
[2022-11-02 20:47:28,158 INFO L899 garLoopResultBuilder]: For program point L2821(lines 2821 2828) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 2814 2830) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L899 garLoopResultBuilder]: For program point nfc_hci_recv_frameFINAL(lines 4551 4553) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L899 garLoopResultBuilder]: For program point nfc_hci_recv_frameEXIT(lines 4551 4553) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L902 garLoopResultBuilder]: At program point nfc_hci_recv_frameENTRY(lines 4551 4553) the Hoare annotation is: true
[2022-11-02 20:47:28,159 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L899 garLoopResultBuilder]: For program point L2843-1(line 2843) no Hoare annotation was computed.
[2022-11-02 20:47:28,159 INFO L902 garLoopResultBuilder]: At program point L2843(line 2843) the Hoare annotation is: true
[2022-11-02 20:47:28,160 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 2831 2847) no Hoare annotation was computed.
[2022-11-02 20:47:28,160 INFO L899 garLoopResultBuilder]: For program point L2838(lines 2838 2845) no Hoare annotation was computed.
[2022-11-02 20:47:28,160 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 2831 2847) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))
[2022-11-02 20:47:28,160 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 2831 2847) no Hoare annotation was computed.
[2022-11-02 20:47:28,160 INFO L899 garLoopResultBuilder]: For program point skb_trimEXIT(lines 4582 4584) no Hoare annotation was computed.
[2022-11-02 20:47:28,160 INFO L902 garLoopResultBuilder]: At program point skb_trimENTRY(lines 4582 4584) the Hoare annotation is: true
[2022-11-02 20:47:28,160 INFO L899 garLoopResultBuilder]: For program point skb_trimFINAL(lines 4582 4584) no Hoare annotation was computed.
[2022-11-02 20:47:28,161 INFO L902 garLoopResultBuilder]: At program point L4065(line 4065) the Hoare annotation is: true
[2022-11-02 20:47:28,161 INFO L899 garLoopResultBuilder]: For program point L3801(lines 3801 3816) no Hoare annotation was computed.
[2022-11-02 20:47:28,161 INFO L899 garLoopResultBuilder]: For program point L3603-1(line 3603) no Hoare annotation was computed.
[2022-11-02 20:47:28,161 INFO L895 garLoopResultBuilder]: At program point L3603(line 3603) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,161 INFO L895 garLoopResultBuilder]: At program point L3240(line 3240) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,161 INFO L899 garLoopResultBuilder]: For program point L3273(lines 3273 3276) no Hoare annotation was computed.
[2022-11-02 20:47:28,162 INFO L899 garLoopResultBuilder]: For program point L3240-1(line 3240) no Hoare annotation was computed.
[2022-11-02 20:47:28,162 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed.
[2022-11-02 20:47:28,162 INFO L899 garLoopResultBuilder]: For program point L3141-1(line 3141) no Hoare annotation was computed.
[2022-11-02 20:47:28,162 INFO L895 garLoopResultBuilder]: At program point L3141(line 3141) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,162 INFO L899 garLoopResultBuilder]: For program point L3802(line 3802) no Hoare annotation was computed.
[2022-11-02 20:47:28,162 INFO L895 garLoopResultBuilder]: At program point L3736(line 3736) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,163 INFO L899 garLoopResultBuilder]: For program point L3736-1(line 3736) no Hoare annotation was computed.
[2022-11-02 20:47:28,163 INFO L899 garLoopResultBuilder]: For program point L3604(lines 3604 3608) no Hoare annotation was computed.
[2022-11-02 20:47:28,163 INFO L899 garLoopResultBuilder]: For program point L3307(lines 3307 3308) no Hoare annotation was computed.
[2022-11-02 20:47:28,163 INFO L895 garLoopResultBuilder]: At program point L3241(lines 3236 3243) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,163 INFO L899 garLoopResultBuilder]: For program point L4166(line 4166) no Hoare annotation was computed.
[2022-11-02 20:47:28,163 INFO L899 garLoopResultBuilder]: For program point L4133(lines 4133 4137) no Hoare annotation was computed.
[2022-11-02 20:47:28,163 INFO L895 garLoopResultBuilder]: At program point L4067(lines 4046 4070) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,164 INFO L899 garLoopResultBuilder]: For program point L3803-1(line 3803) no Hoare annotation was computed.
[2022-11-02 20:47:28,164 INFO L895 garLoopResultBuilder]: At program point L3803(line 3803) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,164 INFO L895 garLoopResultBuilder]: At program point L4134(line 4134) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,164 INFO L899 garLoopResultBuilder]: For program point L4233(line 4233) no Hoare annotation was computed.
[2022-11-02 20:47:28,164 INFO L899 garLoopResultBuilder]: For program point L4167(lines 4167 4201) no Hoare annotation was computed.
[2022-11-02 20:47:28,164 INFO L899 garLoopResultBuilder]: For program point L4134-1(line 4134) no Hoare annotation was computed.
[2022-11-02 20:47:28,165 INFO L895 garLoopResultBuilder]: At program point L4498(lines 4497 4499) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,165 INFO L899 garLoopResultBuilder]: For program point L3309(lines 3309 3312) no Hoare annotation was computed.
[2022-11-02 20:47:28,165 INFO L899 garLoopResultBuilder]: For program point L4234(lines 4234 4237) no Hoare annotation was computed.
[2022-11-02 20:47:28,165 INFO L899 garLoopResultBuilder]: For program point L3309-2(lines 3309 3312) no Hoare annotation was computed.
[2022-11-02 20:47:28,165 INFO L895 garLoopResultBuilder]: At program point L3012(line 3012) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,165 INFO L899 garLoopResultBuilder]: For program point L3012-1(line 3012) no Hoare annotation was computed.
[2022-11-02 20:47:28,165 INFO L899 garLoopResultBuilder]: For program point L3805(line 3805) no Hoare annotation was computed.
[2022-11-02 20:47:28,166 INFO L895 garLoopResultBuilder]: At program point L4367(lines 4367 4368) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,166 INFO L899 garLoopResultBuilder]: For program point L4367-1(lines 4367 4368) no Hoare annotation was computed.
[2022-11-02 20:47:28,166 INFO L895 garLoopResultBuilder]: At program point L3310(line 3310) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,166 INFO L899 garLoopResultBuilder]: For program point L3310-1(line 3310) no Hoare annotation was computed.
[2022-11-02 20:47:28,166 INFO L899 garLoopResultBuilder]: For program point L4169(lines 4169 4198) no Hoare annotation was computed.
[2022-11-02 20:47:28,166 INFO L895 garLoopResultBuilder]: At program point L3145(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,167 INFO L895 garLoopResultBuilder]: At program point L3806(line 3806) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,167 INFO L899 garLoopResultBuilder]: For program point L3806-1(line 3806) no Hoare annotation was computed.
[2022-11-02 20:47:28,167 INFO L899 garLoopResultBuilder]: For program point L3674(lines 3674 3678) no Hoare annotation was computed.
[2022-11-02 20:47:28,167 INFO L895 garLoopResultBuilder]: At program point L3278(line 3278) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,167 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed.
[2022-11-02 20:47:28,167 INFO L899 garLoopResultBuilder]: For program point L3278-1(line 3278) no Hoare annotation was computed.
[2022-11-02 20:47:28,167 INFO L899 garLoopResultBuilder]: For program point L4170(line 4170) no Hoare annotation was computed.
[2022-11-02 20:47:28,168 INFO L895 garLoopResultBuilder]: At program point L3179(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,168 INFO L895 garLoopResultBuilder]: At program point L3014(lines 3007 3016) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,168 INFO L899 garLoopResultBuilder]: For program point L3180(line 3180) no Hoare annotation was computed.
[2022-11-02 20:47:28,168 INFO L899 garLoopResultBuilder]: For program point L3180-2(lines 3180 3183) no Hoare annotation was computed.
[2022-11-02 20:47:28,168 INFO L899 garLoopResultBuilder]: For program point L4171(lines 4171 4176) no Hoare annotation was computed.
[2022-11-02 20:47:28,168 INFO L899 garLoopResultBuilder]: For program point L4204(lines 4204 4231) no Hoare annotation was computed.
[2022-11-02 20:47:28,169 INFO L895 garLoopResultBuilder]: At program point L3147(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,169 INFO L895 garLoopResultBuilder]: At program point L2982(lines 2978 2984) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,169 INFO L899 garLoopResultBuilder]: For program point L3808(line 3808) no Hoare annotation was computed.
[2022-11-02 20:47:28,169 INFO L899 garLoopResultBuilder]: For program point L3610(lines 3610 3614) no Hoare annotation was computed.
[2022-11-02 20:47:28,169 INFO L895 garLoopResultBuilder]: At program point L4502(lines 4501 4503) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,169 INFO L895 garLoopResultBuilder]: At program point L4370(line 4370) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,170 INFO L895 garLoopResultBuilder]: At program point L3280(line 3280) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,170 INFO L899 garLoopResultBuilder]: For program point L4370-1(line 4370) no Hoare annotation was computed.
[2022-11-02 20:47:28,170 INFO L899 garLoopResultBuilder]: For program point L3280-1(line 3280) no Hoare annotation was computed.
[2022-11-02 20:47:28,170 INFO L895 garLoopResultBuilder]: At program point L3181(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,170 INFO L899 garLoopResultBuilder]: For program point L4139(line 4139) no Hoare annotation was computed.
[2022-11-02 20:47:28,170 INFO L899 garLoopResultBuilder]: For program point L3809-1(line 3809) no Hoare annotation was computed.
[2022-11-02 20:47:28,170 INFO L895 garLoopResultBuilder]: At program point L3809(line 3809) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L3710(lines 3710 3714) no Hoare annotation was computed.
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L4371(lines 4371 4374) no Hoare annotation was computed.
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L4371-1(lines 4371 4374) no Hoare annotation was computed.
[2022-11-02 20:47:28,171 INFO L895 garLoopResultBuilder]: At program point L3314(lines 3256 3330) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed.
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L4206(lines 4206 4228) no Hoare annotation was computed.
[2022-11-02 20:47:28,171 INFO L899 garLoopResultBuilder]: For program point L4140(lines 4140 4144) no Hoare annotation was computed.
[2022-11-02 20:47:28,172 INFO L895 garLoopResultBuilder]: At program point L2951(lines 2946 2953) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,172 INFO L895 garLoopResultBuilder]: At program point L3744(line 3744) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,172 INFO L899 garLoopResultBuilder]: For program point L3744-1(line 3744) no Hoare annotation was computed.
[2022-11-02 20:47:28,172 INFO L899 garLoopResultBuilder]: For program point L3579-1(line 3579) no Hoare annotation was computed.
[2022-11-02 20:47:28,172 INFO L895 garLoopResultBuilder]: At program point L3579(line 3579) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,172 INFO L895 garLoopResultBuilder]: At program point L4537(lines 4536 4538) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,173 INFO L895 garLoopResultBuilder]: At program point L4372(line 4372) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,173 INFO L899 garLoopResultBuilder]: For program point L4207(line 4207) no Hoare annotation was computed.
[2022-11-02 20:47:28,173 INFO L899 garLoopResultBuilder]: For program point L3150(lines 3150 3153) no Hoare annotation was computed.
[2022-11-02 20:47:28,173 INFO L902 garLoopResultBuilder]: At program point L4240(line 4240) the Hoare annotation is: true
[2022-11-02 20:47:28,173 INFO L895 garLoopResultBuilder]: At program point L4108(line 4108) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,173 INFO L899 garLoopResultBuilder]: For program point L4075-1(line 4075) no Hoare annotation was computed.
[2022-11-02 20:47:28,174 INFO L899 garLoopResultBuilder]: For program point L4108-1(line 4108) no Hoare annotation was computed.
[2022-11-02 20:47:28,174 INFO L895 garLoopResultBuilder]: At program point L4075(line 4075) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,174 INFO L899 garLoopResultBuilder]: For program point L3811(line 3811) no Hoare annotation was computed.
[2022-11-02 20:47:28,174 INFO L899 garLoopResultBuilder]: For program point L3745(lines 3745 3749) no Hoare annotation was computed.
[2022-11-02 20:47:28,174 INFO L899 garLoopResultBuilder]: For program point L3745-2(lines 3745 3749) no Hoare annotation was computed.
[2022-11-02 20:47:28,174 INFO L902 garLoopResultBuilder]: At program point L4505(lines 4504 4506) the Hoare annotation is: true
[2022-11-02 20:47:28,175 INFO L895 garLoopResultBuilder]: At program point L3316(lines 3256 3330) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,175 INFO L899 garLoopResultBuilder]: For program point L3184(lines 3184 3187) no Hoare annotation was computed.
[2022-11-02 20:47:28,175 INFO L899 garLoopResultBuilder]: For program point L4208(lines 4208 4216) no Hoare annotation was computed.
[2022-11-02 20:47:28,175 INFO L895 garLoopResultBuilder]: At program point L3812(line 3812) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,175 INFO L899 garLoopResultBuilder]: For program point L3812-1(line 3812) no Hoare annotation was computed.
[2022-11-02 20:47:28,175 INFO L895 garLoopResultBuilder]: At program point L3680(line 3680) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,175 INFO L899 garLoopResultBuilder]: For program point L3680-1(line 3680) no Hoare annotation was computed.
[2022-11-02 20:47:28,176 INFO L895 garLoopResultBuilder]: At program point L4242(lines 4107 4247) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,176 INFO L895 garLoopResultBuilder]: At program point L4110(line 4110) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,176 INFO L899 garLoopResultBuilder]: For program point L4110-1(line 4110) no Hoare annotation was computed.
[2022-11-02 20:47:28,176 INFO L895 garLoopResultBuilder]: At program point L4077(lines 4071 4079) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,176 INFO L895 garLoopResultBuilder]: At program point L3780(lines 3775 3782) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,176 INFO L895 garLoopResultBuilder]: At program point L3648(line 3648) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,177 INFO L899 garLoopResultBuilder]: For program point L3681(lines 3681 3684) no Hoare annotation was computed.
[2022-11-02 20:47:28,177 INFO L899 garLoopResultBuilder]: For program point L3582(lines 3582 3586) no Hoare annotation was computed.
[2022-11-02 20:47:28,177 INFO L899 garLoopResultBuilder]: For program point L3648-1(line 3648) no Hoare annotation was computed.
[2022-11-02 20:47:28,177 INFO L895 garLoopResultBuilder]: At program point L4375(lines 4357 4377) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,177 INFO L899 garLoopResultBuilder]: For program point L4210(lines 4210 4214) no Hoare annotation was computed.
[2022-11-02 20:47:28,177 INFO L899 garLoopResultBuilder]: For program point L3814(line 3814) no Hoare annotation was computed.
[2022-11-02 20:47:28,178 INFO L899 garLoopResultBuilder]: For program point L3649(lines 3649 3653) no Hoare annotation was computed.
[2022-11-02 20:47:28,178 INFO L899 garLoopResultBuilder]: For program point L3649-2(lines 3649 3653) no Hoare annotation was computed.
[2022-11-02 20:47:28,178 INFO L899 garLoopResultBuilder]: For program point L3319-1(lines 3256 3330) no Hoare annotation was computed.
[2022-11-02 20:47:28,178 INFO L895 garLoopResultBuilder]: At program point L3319(line 3319) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,178 INFO L899 garLoopResultBuilder]: For program point L4178(line 4178) no Hoare annotation was computed.
[2022-11-02 20:47:28,178 INFO L895 garLoopResultBuilder]: At program point L3154(line 3154) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,178 INFO L895 garLoopResultBuilder]: At program point L4112(line 4112) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,179 INFO L899 garLoopResultBuilder]: For program point L3154-1(line 3154) no Hoare annotation was computed.
[2022-11-02 20:47:28,179 INFO L895 garLoopResultBuilder]: At program point L3022(line 3022) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,179 INFO L899 garLoopResultBuilder]: For program point L4112-1(line 4112) no Hoare annotation was computed.
[2022-11-02 20:47:28,179 INFO L895 garLoopResultBuilder]: At program point L3055(lines 3050 3057) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,179 INFO L899 garLoopResultBuilder]: For program point L3022-1(line 3022) no Hoare annotation was computed.
[2022-11-02 20:47:28,179 INFO L902 garLoopResultBuilder]: At program point L3815(line 3815) the Hoare annotation is: true
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L3320(lines 3320 3327) no Hoare annotation was computed.
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L3287(line 3287) no Hoare annotation was computed.
[2022-11-02 20:47:28,180 INFO L895 garLoopResultBuilder]: At program point L3188(line 3188) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L3287-2(lines 3287 3293) no Hoare annotation was computed.
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L4146(line 4146) no Hoare annotation was computed.
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L3287-4(lines 3287 3293) no Hoare annotation was computed.
[2022-11-02 20:47:28,180 INFO L899 garLoopResultBuilder]: For program point L4179(lines 4179 4194) no Hoare annotation was computed.
[2022-11-02 20:47:28,181 INFO L899 garLoopResultBuilder]: For program point L3188-1(line 3188) no Hoare annotation was computed.
[2022-11-02 20:47:28,181 INFO L899 garLoopResultBuilder]: For program point L3618(lines 3618 3623) no Hoare annotation was computed.
[2022-11-02 20:47:28,181 INFO L899 garLoopResultBuilder]: For program point L3321(lines 3321 3325) no Hoare annotation was computed.
[2022-11-02 20:47:28,181 INFO L902 garLoopResultBuilder]: At program point L4246(lines 4091 4248) the Hoare annotation is: true
[2022-11-02 20:47:28,181 INFO L895 garLoopResultBuilder]: At program point L3189(lines 3118 3191) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,181 INFO L895 garLoopResultBuilder]: At program point L4114(line 4114) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,182 INFO L899 garLoopResultBuilder]: For program point L4147(lines 4147 4151) no Hoare annotation was computed.
[2022-11-02 20:47:28,182 INFO L895 garLoopResultBuilder]: At program point L3024(lines 3017 3026) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,182 INFO L899 garLoopResultBuilder]: For program point L4114-1(line 4114) no Hoare annotation was computed.
[2022-11-02 20:47:28,182 INFO L895 garLoopResultBuilder]: At program point L3817(lines 3796 3820) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,182 INFO L899 garLoopResultBuilder]: For program point L3751-1(lines 3751 3754) no Hoare annotation was computed.
[2022-11-02 20:47:28,182 INFO L899 garLoopResultBuilder]: For program point L3751(lines 3751 3754) no Hoare annotation was computed.
[2022-11-02 20:47:28,182 INFO L899 garLoopResultBuilder]: For program point L3223-1(line 3223) no Hoare annotation was computed.
[2022-11-02 20:47:28,183 INFO L895 garLoopResultBuilder]: At program point L3223(line 3223) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,183 INFO L899 garLoopResultBuilder]: For program point L4181(lines 4181 4187) no Hoare annotation was computed.
[2022-11-02 20:47:28,183 INFO L899 garLoopResultBuilder]: For program point L4181-2(lines 4179 4193) no Hoare annotation was computed.
[2022-11-02 20:47:28,183 INFO L895 garLoopResultBuilder]: At program point L2992(lines 2987 2994) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,183 INFO L895 garLoopResultBuilder]: At program point L3752(line 3752) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,183 INFO L899 garLoopResultBuilder]: For program point L3719(lines 3719 3723) no Hoare annotation was computed.
[2022-11-02 20:47:28,184 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,184 INFO L895 garLoopResultBuilder]: At program point L4116(line 4116) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_1_3~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_1_0~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0) (= ~ldv_irq_2_0~0 0) (= ~ldv_irq_1_1~0 0) (= ~ldv_state_variable_3~0 0) (= ~ldv_irq_1_2~0 0))
[2022-11-02 20:47:28,184 INFO L899 garLoopResultBuilder]: For program point L4116-1(line 4116) no Hoare annotation was computed.
[2022-11-02 20:47:28,184 INFO L899 garLoopResultBuilder]: For program point L3225-1(line 3225) no Hoare annotation was computed.
[2022-11-02 20:47:28,184 INFO L895 garLoopResultBuilder]: At program point L3225(line 3225) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,184 INFO L899 garLoopResultBuilder]: For program point L3159-1(lines 3159 3160) no Hoare annotation was computed.
[2022-11-02 20:47:28,185 INFO L895 garLoopResultBuilder]: At program point L3159(lines 3159 3160) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,185 INFO L899 garLoopResultBuilder]: For program point L4051(lines 4051 4066) no Hoare annotation was computed.
[2022-11-02 20:47:28,185 INFO L902 garLoopResultBuilder]: At program point L3787(lines 3783 3789) the Hoare annotation is: true
[2022-11-02 20:47:28,185 INFO L899 garLoopResultBuilder]: For program point L4052(line 4052) no Hoare annotation was computed.
[2022-11-02 20:47:28,185 INFO L895 garLoopResultBuilder]: At program point L3755(lines 3729 3757) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,185 INFO L895 garLoopResultBuilder]: At program point L3590(line 3590) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,185 INFO L899 garLoopResultBuilder]: For program point L3590-1(line 3590) no Hoare annotation was computed.
[2022-11-02 20:47:28,186 INFO L899 garLoopResultBuilder]: For program point L4218(line 4218) no Hoare annotation was computed.
[2022-11-02 20:47:28,186 INFO L899 garLoopResultBuilder]: For program point L3161(lines 3161 3164) no Hoare annotation was computed.
[2022-11-02 20:47:28,186 INFO L899 garLoopResultBuilder]: For program point L3161-2(lines 3161 3164) no Hoare annotation was computed.
[2022-11-02 20:47:28,186 INFO L899 garLoopResultBuilder]: For program point L4053-1(line 4053) no Hoare annotation was computed.
[2022-11-02 20:47:28,186 INFO L895 garLoopResultBuilder]: At program point L4053(line 4053) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,186 INFO L899 garLoopResultBuilder]: For program point L3690(line 3690) no Hoare annotation was computed.
[2022-11-02 20:47:28,187 INFO L899 garLoopResultBuilder]: For program point L3690-2(lines 3690 3708) no Hoare annotation was computed.
[2022-11-02 20:47:28,187 INFO L899 garLoopResultBuilder]: For program point L3591(lines 3591 3595) no Hoare annotation was computed.
[2022-11-02 20:47:28,187 INFO L895 garLoopResultBuilder]: At program point L4483(line 4483) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,187 INFO L899 garLoopResultBuilder]: For program point L4483-1(line 4483) no Hoare annotation was computed.
[2022-11-02 20:47:28,187 INFO L895 garLoopResultBuilder]: At program point L4483-2(lines 4482 4484) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,187 INFO L895 garLoopResultBuilder]: At program point L3228(line 3228) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,187 INFO L899 garLoopResultBuilder]: For program point L4219(lines 4219 4224) no Hoare annotation was computed.
[2022-11-02 20:47:28,188 INFO L895 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,188 INFO L899 garLoopResultBuilder]: For program point L3228-1(line 3228) no Hoare annotation was computed.
[2022-11-02 20:47:28,188 INFO L899 garLoopResultBuilder]: For program point L4153(line 4153) no Hoare annotation was computed.
[2022-11-02 20:47:28,188 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed.
[2022-11-02 20:47:28,188 INFO L895 garLoopResultBuilder]: At program point L2964(lines 2960 2966) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,188 INFO L895 garLoopResultBuilder]: At program point L3625(lines 3571 3627) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,189 INFO L895 garLoopResultBuilder]: At program point L4517(lines 4516 4518) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,189 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,189 INFO L902 garLoopResultBuilder]: At program point L4154(line 4154) the Hoare annotation is: true
[2022-11-02 20:47:28,189 INFO L899 garLoopResultBuilder]: For program point L4055(line 4055) no Hoare annotation was computed.
[2022-11-02 20:47:28,189 INFO L899 garLoopResultBuilder]: For program point L3692(lines 3692 3696) no Hoare annotation was computed.
[2022-11-02 20:47:28,189 INFO L895 garLoopResultBuilder]: At program point L3296(lines 3256 3330) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,189 INFO L895 garLoopResultBuilder]: At program point L3329(lines 3244 3331) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,190 INFO L899 garLoopResultBuilder]: For program point L3197-1(line 3197) no Hoare annotation was computed.
[2022-11-02 20:47:28,190 INFO L895 garLoopResultBuilder]: At program point L3197(line 3197) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,190 INFO L895 garLoopResultBuilder]: At program point L4056(line 4056) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,190 INFO L899 garLoopResultBuilder]: For program point L4056-1(line 4056) no Hoare annotation was computed.
[2022-11-02 20:47:28,190 INFO L895 garLoopResultBuilder]: At program point L3726(lines 3628 3728) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,190 INFO L895 garLoopResultBuilder]: At program point L3660(line 3660) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,191 INFO L899 garLoopResultBuilder]: For program point L3660-1(line 3660) no Hoare annotation was computed.
[2022-11-02 20:47:28,191 INFO L899 garLoopResultBuilder]: For program point L3297(lines 3297 3300) no Hoare annotation was computed.
[2022-11-02 20:47:28,191 INFO L899 garLoopResultBuilder]: For program point L3231-1(line 3231) no Hoare annotation was computed.
[2022-11-02 20:47:28,191 INFO L895 garLoopResultBuilder]: At program point L3231(line 3231) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,191 INFO L895 garLoopResultBuilder]: At program point L3000(lines 2995 3002) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,191 INFO L899 garLoopResultBuilder]: For program point L3661(lines 3661 3665) no Hoare annotation was computed.
[2022-11-02 20:47:28,192 INFO L899 garLoopResultBuilder]: For program point L3661-2(lines 3661 3665) no Hoare annotation was computed.
[2022-11-02 20:47:28,192 INFO L895 garLoopResultBuilder]: At program point L3298(lines 3256 3330) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,192 INFO L902 garLoopResultBuilder]: At program point L4190(lines 4107 4247) the Hoare annotation is: true
[2022-11-02 20:47:28,192 INFO L895 garLoopResultBuilder]: At program point L3166(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,192 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,192 INFO L899 garLoopResultBuilder]: For program point L4058(line 4058) no Hoare annotation was computed.
[2022-11-02 20:47:28,192 INFO L895 garLoopResultBuilder]: At program point L4587(lines 4586 4588) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,193 INFO L895 garLoopResultBuilder]: At program point L3266(line 3266) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,193 INFO L895 garLoopResultBuilder]: At program point L3200(line 3200) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,193 INFO L899 garLoopResultBuilder]: For program point L3266-1(line 3266) no Hoare annotation was computed.
[2022-11-02 20:47:28,193 INFO L895 garLoopResultBuilder]: At program point L3233(lines 3215 3235) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,193 INFO L899 garLoopResultBuilder]: For program point L3200-1(line 3200) no Hoare annotation was computed.
[2022-11-02 20:47:28,193 INFO L899 garLoopResultBuilder]: For program point L4059-1(line 4059) no Hoare annotation was computed.
[2022-11-02 20:47:28,194 INFO L895 garLoopResultBuilder]: At program point L4059(line 4059) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,194 INFO L899 garLoopResultBuilder]: For program point L3597(lines 3597 3601) no Hoare annotation was computed.
[2022-11-02 20:47:28,194 INFO L899 garLoopResultBuilder]: For program point L3267(lines 3267 3270) no Hoare annotation was computed.
[2022-11-02 20:47:28,194 INFO L895 garLoopResultBuilder]: At program point L3168(lines 3125 3190) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,194 INFO L899 garLoopResultBuilder]: For program point L3267-2(lines 3267 3270) no Hoare annotation was computed.
[2022-11-02 20:47:28,194 INFO L895 garLoopResultBuilder]: At program point L3201(lines 3192 3203) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L4226(line 4226) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L4160(line 4160) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L4127(lines 4127 4241) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L4061(line 4061) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L3698(lines 3698 3708) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L899 garLoopResultBuilder]: For program point L3698-1(lines 3690 3708) no Hoare annotation was computed.
[2022-11-02 20:47:28,195 INFO L895 garLoopResultBuilder]: At program point L4590(lines 4589 4591) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,196 INFO L895 garLoopResultBuilder]: At program point L4458(lines 4457 4459) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,196 INFO L902 garLoopResultBuilder]: At program point L4227(line 4227) the Hoare annotation is: true
[2022-11-02 20:47:28,196 INFO L899 garLoopResultBuilder]: For program point L4128(line 4128) no Hoare annotation was computed.
[2022-11-02 20:47:28,196 INFO L899 garLoopResultBuilder]: For program point L4161(lines 4161 4164) no Hoare annotation was computed.
[2022-11-02 20:47:28,196 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,196 INFO L895 garLoopResultBuilder]: At program point L4062(line 4062) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,196 INFO L895 garLoopResultBuilder]: At program point L3038(line 3038) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,197 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed.
[2022-11-02 20:47:28,197 INFO L899 garLoopResultBuilder]: For program point L4062-1(line 4062) no Hoare annotation was computed.
[2022-11-02 20:47:28,197 INFO L899 garLoopResultBuilder]: For program point L3038-1(line 3038) no Hoare annotation was computed.
[2022-11-02 20:47:28,197 INFO L899 garLoopResultBuilder]: For program point L3303-1(line 3303) no Hoare annotation was computed.
[2022-11-02 20:47:28,197 INFO L895 garLoopResultBuilder]: At program point L3303(line 3303) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,197 INFO L895 garLoopResultBuilder]: At program point L3138(lines 3138 3139) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,198 INFO L899 garLoopResultBuilder]: For program point L3171(lines 3171 3174) no Hoare annotation was computed.
[2022-11-02 20:47:28,198 INFO L899 garLoopResultBuilder]: For program point L4129(lines 4129 4158) no Hoare annotation was computed.
[2022-11-02 20:47:28,198 INFO L899 garLoopResultBuilder]: For program point L3138-1(lines 3138 3139) no Hoare annotation was computed.
[2022-11-02 20:47:28,198 INFO L899 garLoopResultBuilder]: For program point L3700(lines 3700 3704) no Hoare annotation was computed.
[2022-11-02 20:47:28,198 INFO L899 garLoopResultBuilder]: For program point L3667(lines 3667 3671) no Hoare annotation was computed.
[2022-11-02 20:47:28,198 INFO L895 garLoopResultBuilder]: At program point L3568(lines 3565 3570) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,198 INFO L902 garLoopResultBuilder]: At program point L4526(lines 4525 4527) the Hoare annotation is: true
[2022-11-02 20:47:28,199 INFO L899 garLoopResultBuilder]: For program point L3271-1(lines 3271 3272) no Hoare annotation was computed.
[2022-11-02 20:47:28,199 INFO L895 garLoopResultBuilder]: At program point L3271(lines 3271 3272) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,199 INFO L899 garLoopResultBuilder]: For program point L4196(line 4196) no Hoare annotation was computed.
[2022-11-02 20:47:28,199 INFO L899 garLoopResultBuilder]: For program point L4064(line 4064) no Hoare annotation was computed.
[2022-11-02 20:47:28,199 INFO L895 garLoopResultBuilder]: At program point L3040(lines 3033 3042) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,199 INFO L899 garLoopResultBuilder]: For program point L3602(lines 3602 3616) no Hoare annotation was computed.
[2022-11-02 20:47:28,200 INFO L899 garLoopResultBuilder]: For program point L3602-2(lines 3602 3616) no Hoare annotation was computed.
[2022-11-02 20:47:28,200 INFO L895 garLoopResultBuilder]: At program point L4494(lines 4493 4495) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,200 INFO L899 garLoopResultBuilder]: For program point L3239-1(line 3239) no Hoare annotation was computed.
[2022-11-02 20:47:28,200 INFO L895 garLoopResultBuilder]: At program point L3239(line 3239) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_irq_2_2~0 0) (= ~ldv_irq_2_3~0 0) (= ~ldv_irq_2_1~0 0))
[2022-11-02 20:47:28,200 INFO L899 garLoopResultBuilder]: For program point L3140(lines 3140 3143) no Hoare annotation was computed.
[2022-11-02 20:47:28,200 INFO L902 garLoopResultBuilder]: At program point L4197(line 4197) the Hoare annotation is: true
[2022-11-02 20:47:28,200 INFO L899 garLoopResultBuilder]: For program point L3140-2(lines 3140 3143) no Hoare annotation was computed.
[2022-11-02 20:47:28,201 INFO L899 garLoopResultBuilder]: For program point L4131(lines 4131 4155) no Hoare annotation was computed.
[2022-11-02 20:47:28,201 INFO L899 garLoopResultBuilder]: For program point L4383(lines 4383 4386) no Hoare annotation was computed.
[2022-11-02 20:47:28,201 INFO L895 garLoopResultBuilder]: At program point L4385(line 4385) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= ~ldv_irq_2_1~0 0)) (not (= ~ldv_irq_2_2~0 0)) (not (= ~ldv_irq_2_3~0 0)))
[2022-11-02 20:47:28,201 INFO L899 garLoopResultBuilder]: For program point L4385-1(lines 4380 4389) no Hoare annotation was computed.
[2022-11-02 20:47:28,201 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 4380 4389) no Hoare annotation was computed.
[2022-11-02 20:47:28,201 INFO L902 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 4380 4389) the Hoare annotation is: true
[2022-11-02 20:47:28,205 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:28,207 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:47:28,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:47:28 BoogieIcfgContainer
[2022-11-02 20:47:28,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:47:28,274 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:47:28,274 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:47:28,274 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:47:28,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:32" (3/4) ...
[2022-11-02 20:47:28,279 INFO L137 WitnessPrinter]: Generating witness for correct program
[2022-11-02 20:47:28,286 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure print_hex_dump
[2022-11-02 20:47:28,286 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usleep_range
[2022-11-02 20:47:28,286 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure devm_gpio_request
[2022-11-02 20:47:28,286 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure msleep
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure st21nfca_hci_i2c_disable
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_put
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure i2c_master_send
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure i2c_master_recv
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure devm_request_threaded_irq
[2022-11-02 20:47:28,287 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_pull
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_skb
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_2
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure crc_ccitt
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_nested
[2022-11-02 20:47:28,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gpio_set_value
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_push
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure i2c_get_clientdata
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reg_check_1
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_suitable_irq_1
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure st21nfca_hci_irq_thread_fn
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gpio_to_desc
[2022-11-02 20:47:28,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc
[2022-11-02 20:47:28,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nfc_hci_recv_frame
[2022-11-02 20:47:28,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc
[2022-11-02 20:47:28,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_trim
[2022-11-02 20:47:28,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags
[2022-11-02 20:47:28,335 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 263 nodes and edges
[2022-11-02 20:47:28,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges
[2022-11-02 20:47:28,340 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges
[2022-11-02 20:47:28,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges
[2022-11-02 20:47:28,345 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2022-11-02 20:47:28,348 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2022-11-02 20:47:28,350 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2022-11-02 20:47:28,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((state == 0 || !(ldv_spin == 0)) || !(ldv_irq_2_1 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || !(ldv_irq_1_3 == 0)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid))
[2022-11-02 20:47:28,399 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid)) && (((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_3 == 0)) || state == 0)
[2022-11-02 20:47:28,401 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || !(ldv_irq_1_3 == 0)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid))
[2022-11-02 20:47:28,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_3 == 0))
[2022-11-02 20:47:28,552 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:47:28,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:47:28,553 INFO L158 Benchmark]: Toolchain (without parser) took 62256.20ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 68.1MB in the beginning and 1.0GB in the end (delta: -975.6MB). Peak memory consumption was 494.5MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,553 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:47:28,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1932.74ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 67.8MB in the beginning and 93.2MB in the end (delta: -25.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 177.50ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 82.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,554 INFO L158 Benchmark]: Boogie Preprocessor took 129.54ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 71.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,555 INFO L158 Benchmark]: RCFGBuilder took 4400.94ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 71.5MB in the beginning and 156.1MB in the end (delta: -84.5MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,556 INFO L158 Benchmark]: TraceAbstraction took 55327.51ms. Allocated memory was 249.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 155.0MB in the beginning and 1.1GB in the end (delta: -917.0MB). Peak memory consumption was 967.6MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,556 INFO L158 Benchmark]: Witness Printer took 278.63ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2022-11-02 20:47:28,562 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.34ms. Allocated memory is still 83.9MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1932.74ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 67.8MB in the beginning and 93.2MB in the end (delta: -25.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 177.50ms. Allocated memory is still 146.8MB. Free memory was 93.2MB in the beginning and 82.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 129.54ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 71.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* RCFGBuilder took 4400.94ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 71.5MB in the beginning and 156.1MB in the end (delta: -84.5MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 55327.51ms. Allocated memory was 249.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 155.0MB in the beginning and 1.1GB in the end (delta: -917.0MB). Peak memory consumption was 967.6MB. Max. memory is 16.1GB.
* Witness Printer took 278.63ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* 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: 2868]: 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 33 procedures, 520 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.2s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8774 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8168 mSDsluCounter, 23646 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15682 mSDsCounter, 1762 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6405 IncrementalHoareTripleChecker+Invalid, 8167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1762 mSolverCounterUnsat, 7964 mSDtfsCounter, 6405 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8321occurred in iteration=8, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 2436 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 197 LocationsWithAnnotation, 16958 PreInvPairs, 19215 NumberOfFragments, 2373 HoareAnnotationTreeSize, 16958 FomulaSimplifications, 143040 FormulaSimplificationTreeSizeReduction, 12.5s HoareSimplificationTime, 197 FomulaSimplificationsInter, 279554 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 2179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2623 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 553/555 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 4595]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3383]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2960]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3419]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3796]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3628]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4589]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4501]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3371]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3432]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3017]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4071]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4529]: Loop Invariant
Derived loop invariant: (((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || !(ldv_irq_1_3 == 0)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid))
- InvariantResult [Line: 3783]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3353]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3775]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 2987]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: -1]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4533]: Loop Invariant
Derived loop invariant: ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_3 == 0))
- InvariantResult [Line: 4493]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4497]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 2995]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4482]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4107]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4046]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3077]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4519]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3335]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3332]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4009]: Loop Invariant
Derived loop invariant: ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid)) && (((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_3 == 0)) || state == 0)
- InvariantResult [Line: 3236]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3571]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4586]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4107]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3033]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3729]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 2978]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3335]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4536]: Loop Invariant
Derived loop invariant: ((((((((ldv_spin == 0 && ldv_irq_1_3 == 0) && ldv_irq_2_2 == 0) && ldv_irq_1_0 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0) && ldv_irq_2_0 == 0) && ldv_irq_1_1 == 0) && ldv_state_variable_3 == 0) && ldv_irq_1_2 == 0
- InvariantResult [Line: 3966]: Loop Invariant
Derived loop invariant: ((((((state == 0 || !(ldv_spin == 0)) || !(ldv_irq_2_1 == 0)) || !(\old(state) == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || !(ldv_irq_1_3 == 0)) && ((((!(ldv_spin == 0) || !(ldv_irq_2_1 == 0)) || !(ldv_irq_2_2 == 0)) || !(ldv_irq_2_3 == 0)) || ((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(\valid) == \valid))
- InvariantResult [Line: 3383]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3027]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3007]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4357]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: -1]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 2954]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3050]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3125]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4525]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4516]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 2946]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 2871]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4457]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4440]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3256]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 4091]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 4504]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3215]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3256]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3192]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3256]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3118]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3244]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3432]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 3565]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
- InvariantResult [Line: 3256]: Loop Invariant
Derived loop invariant: ((ldv_spin == 0 && ldv_irq_2_2 == 0) && ldv_irq_2_3 == 0) && ldv_irq_2_1 == 0
RESULT: Ultimate proved your program to be correct!
[2022-11-02 20:47:28,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13de147-e904-4665-a6e4-ce0e08030ddd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE