./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 02:08:31,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 02:08:31,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 02:08:31,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 02:08:31,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 02:08:31,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 02:08:31,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 02:08:31,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 02:08:31,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 02:08:31,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 02:08:31,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 02:08:31,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 02:08:31,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 02:08:31,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 02:08:31,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 02:08:32,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 02:08:32,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 02:08:32,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 02:08:32,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 02:08:32,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 02:08:32,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 02:08:32,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 02:08:32,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 02:08:32,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 02:08:32,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 02:08:32,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 02:08:32,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 02:08:32,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 02:08:32,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 02:08:32,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 02:08:32,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 02:08:32,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 02:08:32,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 02:08:32,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 02:08:32,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 02:08:32,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 02:08:32,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 02:08:32,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 02:08:32,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 02:08:32,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 02:08:32,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 02:08:32,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 02:08:32,055 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 02:08:32,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 02:08:32,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 02:08:32,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 02:08:32,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 02:08:32,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 02:08:32,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 02:08:32,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 02:08:32,057 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 02:08:32,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 02:08:32,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 02:08:32,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 02:08:32,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 02:08:32,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 02:08:32,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 02:08:32,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 02:08:32,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 02:08:32,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 02:08:32,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 02:08:32,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 02:08:32,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 02:08:32,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2021-12-18 02:08:32,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 02:08:32,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 02:08:32,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 02:08:32,256 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 02:08:32,256 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 02:08:32,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-12-18 02:08:32,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b2151c3/b58645d2efb14e13848dad67bb402477/FLAG164517ed7 [2021-12-18 02:08:32,763 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 02:08:32,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-12-18 02:08:32,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b2151c3/b58645d2efb14e13848dad67bb402477/FLAG164517ed7 [2021-12-18 02:08:33,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b2151c3/b58645d2efb14e13848dad67bb402477 [2021-12-18 02:08:33,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 02:08:33,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 02:08:33,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 02:08:33,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 02:08:33,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 02:08:33,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:08:33" (1/1) ... [2021-12-18 02:08:33,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1402e816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:33, skipping insertion in model container [2021-12-18 02:08:33,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:08:33" (1/1) ... [2021-12-18 02:08:33,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 02:08:33,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 02:08:33,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-12-18 02:08:33,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 02:08:33,913 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 02:08:34,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-12-18 02:08:34,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 02:08:34,057 INFO L208 MainTranslator]: Completed translation [2021-12-18 02:08:34,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34 WrapperNode [2021-12-18 02:08:34,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 02:08:34,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 02:08:34,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 02:08:34,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 02:08:34,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,139 INFO L137 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 1101 [2021-12-18 02:08:34,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 02:08:34,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 02:08:34,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 02:08:34,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 02:08:34,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 02:08:34,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 02:08:34,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 02:08:34,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 02:08:34,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (1/1) ... [2021-12-18 02:08:34,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 02:08:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 02:08:34,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 02:08:34,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 02:08:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 02:08:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 02:08:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 02:08:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 02:08:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 02:08:34,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 02:08:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 02:08:34,280 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 02:08:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 02:08:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-18 02:08:34,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-18 02:08:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2021-12-18 02:08:34,280 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2021-12-18 02:08:34,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2021-12-18 02:08:34,281 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2021-12-18 02:08:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2021-12-18 02:08:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-18 02:08:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2021-12-18 02:08:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2021-12-18 02:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-12-18 02:08:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-12-18 02:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 02:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 02:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-12-18 02:08:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-12-18 02:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2021-12-18 02:08:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2021-12-18 02:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-18 02:08:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-18 02:08:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-18 02:08:34,284 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-18 02:08:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 02:08:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-12-18 02:08:34,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-12-18 02:08:34,285 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2021-12-18 02:08:34,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2021-12-18 02:08:34,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 02:08:34,285 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2021-12-18 02:08:34,285 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2021-12-18 02:08:34,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 02:08:34,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 02:08:34,547 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 02:08:34,549 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 02:08:35,155 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 02:08:35,160 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 02:08:35,161 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 02:08:35,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:08:35 BoogieIcfgContainer [2021-12-18 02:08:35,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 02:08:35,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 02:08:35,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 02:08:35,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 02:08:35,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:08:33" (1/3) ... [2021-12-18 02:08:35,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca630a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:08:35, skipping insertion in model container [2021-12-18 02:08:35,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:08:34" (2/3) ... [2021-12-18 02:08:35,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ca630a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:08:35, skipping insertion in model container [2021-12-18 02:08:35,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:08:35" (3/3) ... [2021-12-18 02:08:35,173 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-12-18 02:08:35,176 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 02:08:35,176 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 02:08:35,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 02:08:35,226 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 02:08:35,226 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 02:08:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-12-18 02:08:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-18 02:08:35,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:35,251 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:35,251 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1527877958, now seen corresponding path program 1 times [2021-12-18 02:08:35,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:35,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460200768] [2021-12-18 02:08:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:35,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 02:08:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 02:08:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 02:08:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 02:08:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 02:08:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:35,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:35,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460200768] [2021-12-18 02:08:35,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460200768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:35,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:35,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:35,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210551333] [2021-12-18 02:08:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:35,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:35,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:35,922 INFO L87 Difference]: Start difference. First operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-18 02:08:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:36,700 INFO L93 Difference]: Finished difference Result 678 states and 930 transitions. [2021-12-18 02:08:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 02:08:36,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2021-12-18 02:08:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:36,731 INFO L225 Difference]: With dead ends: 678 [2021-12-18 02:08:36,731 INFO L226 Difference]: Without dead ends: 375 [2021-12-18 02:08:36,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:36,747 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 325 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:36,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 1473 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 02:08:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-12-18 02:08:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 263. [2021-12-18 02:08:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 204 states have internal predecessors, (258), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-18 02:08:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2021-12-18 02:08:36,823 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 122 [2021-12-18 02:08:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:36,837 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2021-12-18 02:08:36,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-18 02:08:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2021-12-18 02:08:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 02:08:36,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:36,844 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:36,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 02:08:36,845 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1747602214, now seen corresponding path program 1 times [2021-12-18 02:08:36,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:36,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648784034] [2021-12-18 02:08:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:36,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:37,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:37,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648784034] [2021-12-18 02:08:37,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648784034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:37,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:37,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 02:08:37,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20370991] [2021-12-18 02:08:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:37,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 02:08:37,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:37,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 02:08:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 02:08:37,072 INFO L87 Difference]: Start difference. First operand 263 states and 346 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:37,585 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2021-12-18 02:08:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 02:08:37,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-12-18 02:08:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:37,589 INFO L225 Difference]: With dead ends: 548 [2021-12-18 02:08:37,591 INFO L226 Difference]: Without dead ends: 293 [2021-12-18 02:08:37,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:37,593 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 155 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:37,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 874 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 02:08:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-18 02:08:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2021-12-18 02:08:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.2821782178217822) internal successors, (259), 205 states have internal predecessors, (259), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-18 02:08:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 347 transitions. [2021-12-18 02:08:37,635 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 347 transitions. Word has length 130 [2021-12-18 02:08:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:37,636 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 347 transitions. [2021-12-18 02:08:37,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 347 transitions. [2021-12-18 02:08:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 02:08:37,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:37,637 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:37,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 02:08:37,638 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash -329734684, now seen corresponding path program 1 times [2021-12-18 02:08:37,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:37,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576280559] [2021-12-18 02:08:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:37,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:37,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576280559] [2021-12-18 02:08:37,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576280559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:37,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:37,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:37,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827305600] [2021-12-18 02:08:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:37,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:37,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:37,783 INFO L87 Difference]: Start difference. First operand 264 states and 347 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:38,506 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2021-12-18 02:08:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 02:08:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-12-18 02:08:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:38,511 INFO L225 Difference]: With dead ends: 627 [2021-12-18 02:08:38,511 INFO L226 Difference]: Without dead ends: 371 [2021-12-18 02:08:38,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:38,513 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 308 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:38,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1374 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 02:08:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-12-18 02:08:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 266. [2021-12-18 02:08:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 207 states have internal predecessors, (261), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-18 02:08:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2021-12-18 02:08:38,527 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 130 [2021-12-18 02:08:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:38,527 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2021-12-18 02:08:38,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2021-12-18 02:08:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 02:08:38,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:38,529 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:38,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 02:08:38,529 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1056468710, now seen corresponding path program 1 times [2021-12-18 02:08:38,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:38,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714185777] [2021-12-18 02:08:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:38,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:38,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:38,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714185777] [2021-12-18 02:08:38,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714185777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:38,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:38,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 02:08:38,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328747784] [2021-12-18 02:08:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:38,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 02:08:38,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 02:08:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 02:08:38,740 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:39,913 INFO L93 Difference]: Finished difference Result 863 states and 1155 transitions. [2021-12-18 02:08:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 02:08:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-12-18 02:08:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:39,918 INFO L225 Difference]: With dead ends: 863 [2021-12-18 02:08:39,918 INFO L226 Difference]: Without dead ends: 859 [2021-12-18 02:08:39,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-12-18 02:08:39,919 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1105 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:39,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 1414 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 02:08:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-18 02:08:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 772. [2021-12-18 02:08:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 594 states have (on average 1.2811447811447811) internal successors, (761), 601 states have internal predecessors, (761), 129 states have call successors, (129), 49 states have call predecessors, (129), 48 states have return successors, (131), 127 states have call predecessors, (131), 127 states have call successors, (131) [2021-12-18 02:08:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2021-12-18 02:08:39,954 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1021 transitions. Word has length 130 [2021-12-18 02:08:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:39,955 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 1021 transitions. [2021-12-18 02:08:39,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-18 02:08:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1021 transitions. [2021-12-18 02:08:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-18 02:08:39,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:39,956 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:39,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 02:08:39,957 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash 88761714, now seen corresponding path program 1 times [2021-12-18 02:08:39,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184011826] [2021-12-18 02:08:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:39,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 02:08:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:40,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:40,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184011826] [2021-12-18 02:08:40,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184011826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 02:08:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234764686] [2021-12-18 02:08:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:40,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 02:08:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 02:08:40,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 02:08:40,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 02:08:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:40,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 02:08:40,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 02:08:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 02:08:40,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 02:08:40,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234764686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:40,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 02:08:40,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-18 02:08:40,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256694377] [2021-12-18 02:08:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:40,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 02:08:40,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 02:08:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 02:08:40,770 INFO L87 Difference]: Start difference. First operand 772 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-18 02:08:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:40,813 INFO L93 Difference]: Finished difference Result 1538 states and 2037 transitions. [2021-12-18 02:08:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 02:08:40,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2021-12-18 02:08:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:40,819 INFO L225 Difference]: With dead ends: 1538 [2021-12-18 02:08:40,820 INFO L226 Difference]: Without dead ends: 1280 [2021-12-18 02:08:40,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 02:08:40,827 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 326 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:40,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 02:08:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-12-18 02:08:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1025. [2021-12-18 02:08:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 789 states have (on average 1.2801013941698351) internal successors, (1010), 798 states have internal predecessors, (1010), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-12-18 02:08:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1354 transitions. [2021-12-18 02:08:40,871 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1354 transitions. Word has length 140 [2021-12-18 02:08:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:40,871 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1354 transitions. [2021-12-18 02:08:40,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-18 02:08:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1354 transitions. [2021-12-18 02:08:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-18 02:08:40,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:40,874 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 02:08:41,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 02:08:41,102 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1821132084, now seen corresponding path program 1 times [2021-12-18 02:08:41,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490937265] [2021-12-18 02:08:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:41,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 02:08:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-18 02:08:41,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:41,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490937265] [2021-12-18 02:08:41,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490937265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:41,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:41,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:41,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083376385] [2021-12-18 02:08:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:41,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:41,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:41,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:41,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:41,295 INFO L87 Difference]: Start difference. First operand 1025 states and 1354 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:41,986 INFO L93 Difference]: Finished difference Result 2698 states and 3689 transitions. [2021-12-18 02:08:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 02:08:41,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-12-18 02:08:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:41,992 INFO L225 Difference]: With dead ends: 2698 [2021-12-18 02:08:41,992 INFO L226 Difference]: Without dead ends: 1681 [2021-12-18 02:08:41,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:41,998 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 291 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:41,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1695 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 02:08:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2021-12-18 02:08:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1033. [2021-12-18 02:08:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 797 states have (on average 1.2772898368883312) internal successors, (1018), 806 states have internal predecessors, (1018), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-12-18 02:08:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1362 transitions. [2021-12-18 02:08:42,048 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1362 transitions. Word has length 184 [2021-12-18 02:08:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:42,050 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1362 transitions. [2021-12-18 02:08:42,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1362 transitions. [2021-12-18 02:08:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-18 02:08:42,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:42,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:42,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 02:08:42,055 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1580348874, now seen corresponding path program 1 times [2021-12-18 02:08:42,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:42,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035798752] [2021-12-18 02:08:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:42,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 02:08:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-18 02:08:42,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:42,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035798752] [2021-12-18 02:08:42,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035798752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:42,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:42,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 02:08:42,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433721909] [2021-12-18 02:08:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:42,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 02:08:42,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 02:08:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 02:08:42,321 INFO L87 Difference]: Start difference. First operand 1033 states and 1362 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:42,927 INFO L93 Difference]: Finished difference Result 2178 states and 2895 transitions. [2021-12-18 02:08:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 02:08:42,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-12-18 02:08:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:42,932 INFO L225 Difference]: With dead ends: 2178 [2021-12-18 02:08:42,932 INFO L226 Difference]: Without dead ends: 1153 [2021-12-18 02:08:42,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:42,935 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 155 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:42,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 874 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 02:08:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-12-18 02:08:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1037. [2021-12-18 02:08:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 801 states have (on average 1.2759051186017478) internal successors, (1022), 810 states have internal predecessors, (1022), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-12-18 02:08:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1366 transitions. [2021-12-18 02:08:43,000 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1366 transitions. Word has length 184 [2021-12-18 02:08:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:43,001 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1366 transitions. [2021-12-18 02:08:43,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1366 transitions. [2021-12-18 02:08:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-18 02:08:43,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:43,003 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:43,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 02:08:43,004 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 347923828, now seen corresponding path program 1 times [2021-12-18 02:08:43,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356424605] [2021-12-18 02:08:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:43,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 02:08:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-18 02:08:43,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:43,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356424605] [2021-12-18 02:08:43,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356424605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:43,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:43,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:43,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482169970] [2021-12-18 02:08:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:43,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:43,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:43,170 INFO L87 Difference]: Start difference. First operand 1037 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:44,108 INFO L93 Difference]: Finished difference Result 3838 states and 5391 transitions. [2021-12-18 02:08:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 02:08:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-12-18 02:08:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:44,120 INFO L225 Difference]: With dead ends: 3838 [2021-12-18 02:08:44,120 INFO L226 Difference]: Without dead ends: 2809 [2021-12-18 02:08:44,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:44,124 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 636 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:44,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 2255 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 02:08:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2021-12-18 02:08:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1045. [2021-12-18 02:08:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 809 states have (on average 1.273176761433869) internal successors, (1030), 818 states have internal predecessors, (1030), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-12-18 02:08:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1374 transitions. [2021-12-18 02:08:44,180 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1374 transitions. Word has length 184 [2021-12-18 02:08:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:44,180 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1374 transitions. [2021-12-18 02:08:44,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1374 transitions. [2021-12-18 02:08:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-18 02:08:44,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:44,183 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:44,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 02:08:44,183 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash 830531558, now seen corresponding path program 1 times [2021-12-18 02:08:44,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204634578] [2021-12-18 02:08:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:44,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 02:08:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 02:08:44,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204634578] [2021-12-18 02:08:44,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204634578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:44,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:44,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:44,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097553536] [2021-12-18 02:08:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:44,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:44,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:44,377 INFO L87 Difference]: Start difference. First operand 1045 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:45,335 INFO L93 Difference]: Finished difference Result 3946 states and 5543 transitions. [2021-12-18 02:08:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 02:08:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-12-18 02:08:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:45,349 INFO L225 Difference]: With dead ends: 3946 [2021-12-18 02:08:45,349 INFO L226 Difference]: Without dead ends: 2909 [2021-12-18 02:08:45,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:45,354 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 737 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:45,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 2118 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 02:08:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-12-18 02:08:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1124. [2021-12-18 02:08:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 880 states have (on average 1.2761363636363636) internal successors, (1123), 889 states have internal predecessors, (1123), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-12-18 02:08:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1483 transitions. [2021-12-18 02:08:45,421 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1483 transitions. Word has length 185 [2021-12-18 02:08:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:45,421 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1483 transitions. [2021-12-18 02:08:45,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1483 transitions. [2021-12-18 02:08:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-18 02:08:45,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:45,423 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:45,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 02:08:45,424 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1883377874, now seen corresponding path program 1 times [2021-12-18 02:08:45,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334728719] [2021-12-18 02:08:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:45,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 02:08:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-18 02:08:45,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334728719] [2021-12-18 02:08:45,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334728719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:45,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:45,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:45,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824986260] [2021-12-18 02:08:45,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:45,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:45,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:45,607 INFO L87 Difference]: Start difference. First operand 1124 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:46,561 INFO L93 Difference]: Finished difference Result 4208 states and 5903 transitions. [2021-12-18 02:08:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 02:08:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-12-18 02:08:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:46,574 INFO L225 Difference]: With dead ends: 4208 [2021-12-18 02:08:46,574 INFO L226 Difference]: Without dead ends: 3092 [2021-12-18 02:08:46,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:46,579 INFO L933 BasicCegarLoop]: 713 mSDtfsCounter, 686 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:46,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 2452 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 02:08:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2021-12-18 02:08:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1132. [2021-12-18 02:08:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 888 states have (on average 1.2736486486486487) internal successors, (1131), 897 states have internal predecessors, (1131), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-12-18 02:08:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1491 transitions. [2021-12-18 02:08:46,660 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1491 transitions. Word has length 185 [2021-12-18 02:08:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:46,663 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 1491 transitions. [2021-12-18 02:08:46,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 02:08:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1491 transitions. [2021-12-18 02:08:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-18 02:08:46,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:46,666 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:46,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 02:08:46,667 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash -124338905, now seen corresponding path program 1 times [2021-12-18 02:08:46,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:46,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545708490] [2021-12-18 02:08:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:46,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 02:08:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 02:08:46,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:46,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545708490] [2021-12-18 02:08:46,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545708490] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 02:08:46,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210223277] [2021-12-18 02:08:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:46,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 02:08:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 02:08:46,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 02:08:46,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 02:08:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:47,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1934 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 02:08:47,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 02:08:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 02:08:47,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 02:08:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-18 02:08:47,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210223277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 02:08:47,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 02:08:47,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-12-18 02:08:47,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602805169] [2021-12-18 02:08:47,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 02:08:47,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 02:08:47,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 02:08:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:47,913 INFO L87 Difference]: Start difference. First operand 1132 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 02:08:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:48,748 INFO L93 Difference]: Finished difference Result 3782 states and 5259 transitions. [2021-12-18 02:08:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 02:08:48,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 186 [2021-12-18 02:08:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:48,758 INFO L225 Difference]: With dead ends: 3782 [2021-12-18 02:08:48,758 INFO L226 Difference]: Without dead ends: 2658 [2021-12-18 02:08:48,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-18 02:08:48,761 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 666 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:48,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 1663 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 02:08:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-12-18 02:08:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1508. [2021-12-18 02:08:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1216 states have (on average 1.278782894736842) internal successors, (1555), 1225 states have internal predecessors, (1555), 227 states have call successors, (227), 65 states have call predecessors, (227), 64 states have return successors, (229), 225 states have call predecessors, (229), 225 states have call successors, (229) [2021-12-18 02:08:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2011 transitions. [2021-12-18 02:08:48,831 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2011 transitions. Word has length 186 [2021-12-18 02:08:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:48,831 INFO L470 AbstractCegarLoop]: Abstraction has 1508 states and 2011 transitions. [2021-12-18 02:08:48,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 02:08:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2011 transitions. [2021-12-18 02:08:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-12-18 02:08:48,834 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:48,834 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 02:08:49,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-18 02:08:49,048 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248058, now seen corresponding path program 1 times [2021-12-18 02:08:49,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821883056] [2021-12-18 02:08:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:49,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 02:08:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-18 02:08:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-12-18 02:08:49,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:49,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821883056] [2021-12-18 02:08:49,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821883056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:49,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:49,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 02:08:49,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713973686] [2021-12-18 02:08:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:49,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 02:08:49,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 02:08:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 02:08:49,255 INFO L87 Difference]: Start difference. First operand 1508 states and 2011 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 02:08:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:50,695 INFO L93 Difference]: Finished difference Result 6299 states and 8785 transitions. [2021-12-18 02:08:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 02:08:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 198 [2021-12-18 02:08:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:50,705 INFO L225 Difference]: With dead ends: 6299 [2021-12-18 02:08:50,705 INFO L226 Difference]: Without dead ends: 2347 [2021-12-18 02:08:50,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-18 02:08:50,714 INFO L933 BasicCegarLoop]: 784 mSDtfsCounter, 1400 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 3217 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:50,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 3217 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-18 02:08:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2021-12-18 02:08:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1033. [2021-12-18 02:08:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 825 states have (on average 1.2521212121212122) internal successors, (1033), 832 states have internal predecessors, (1033), 159 states have call successors, (159), 49 states have call predecessors, (159), 48 states have return successors, (159), 157 states have call predecessors, (159), 157 states have call successors, (159) [2021-12-18 02:08:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1351 transitions. [2021-12-18 02:08:50,793 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1351 transitions. Word has length 198 [2021-12-18 02:08:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:50,793 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1351 transitions. [2021-12-18 02:08:50,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 02:08:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1351 transitions. [2021-12-18 02:08:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-12-18 02:08:50,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:50,796 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:50,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 02:08:50,797 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -829148697, now seen corresponding path program 1 times [2021-12-18 02:08:50,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:50,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979633632] [2021-12-18 02:08:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:50,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 02:08:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-18 02:08:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-18 02:08:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-12-18 02:08:50,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979633632] [2021-12-18 02:08:50,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979633632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:50,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:50,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 02:08:50,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21001319] [2021-12-18 02:08:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:50,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 02:08:50,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 02:08:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 02:08:50,993 INFO L87 Difference]: Start difference. First operand 1033 states and 1351 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 02:08:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:51,726 INFO L93 Difference]: Finished difference Result 2916 states and 3972 transitions. [2021-12-18 02:08:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 02:08:51,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 220 [2021-12-18 02:08:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:51,733 INFO L225 Difference]: With dead ends: 2916 [2021-12-18 02:08:51,733 INFO L226 Difference]: Without dead ends: 1891 [2021-12-18 02:08:51,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 02:08:51,737 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 491 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:51,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 1814 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 02:08:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-18 02:08:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 947. [2021-12-18 02:08:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 747 states have (on average 1.2409638554216869) internal successors, (927), 754 states have internal predecessors, (927), 151 states have call successors, (151), 49 states have call predecessors, (151), 48 states have return successors, (151), 149 states have call predecessors, (151), 149 states have call successors, (151) [2021-12-18 02:08:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1229 transitions. [2021-12-18 02:08:51,792 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1229 transitions. Word has length 220 [2021-12-18 02:08:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:51,793 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1229 transitions. [2021-12-18 02:08:51,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 02:08:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1229 transitions. [2021-12-18 02:08:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-12-18 02:08:51,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 02:08:51,796 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:08:51,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 02:08:51,797 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 02:08:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 02:08:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 533574185, now seen corresponding path program 1 times [2021-12-18 02:08:51,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 02:08:51,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032109598] [2021-12-18 02:08:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 02:08:51,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 02:08:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 02:08:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 02:08:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 02:08:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 02:08:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 02:08:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 02:08:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 02:08:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 02:08:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 02:08:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 02:08:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 02:08:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 02:08:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 02:08:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 02:08:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 02:08:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-18 02:08:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-12-18 02:08:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 02:08:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 02:08:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-18 02:08:52,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 02:08:52,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032109598] [2021-12-18 02:08:52,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032109598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 02:08:52,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 02:08:52,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 02:08:52,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467508727] [2021-12-18 02:08:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 02:08:52,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 02:08:52,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 02:08:52,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 02:08:52,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 02:08:52,076 INFO L87 Difference]: Start difference. First operand 947 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-18 02:08:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 02:08:52,896 INFO L93 Difference]: Finished difference Result 1373 states and 1816 transitions. [2021-12-18 02:08:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 02:08:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 236 [2021-12-18 02:08:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 02:08:52,897 INFO L225 Difference]: With dead ends: 1373 [2021-12-18 02:08:52,897 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 02:08:52,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-18 02:08:52,900 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 1567 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 02:08:52,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1634 Valid, 888 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 02:08:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 02:08:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 02:08:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 02:08:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 02:08:52,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2021-12-18 02:08:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 02:08:52,902 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 02:08:52,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-18 02:08:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 02:08:52,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 02:08:52,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 02:08:52,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 02:08:52,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 02:10:31,270 WARN L227 SmtUtils]: Spent 13.48s on a formula simplification. DAG size of input: 255 DAG size of output: 204 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-18 02:11:54,984 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (= |#valid| |old(#valid)|)) (.cse1 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (and (or .cse0 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))) (or .cse0 (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse1) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse0 .cse2) (or .cse0 .cse1 .cse2))) [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L861 garLoopResultBuilder]: At program point ipmi_destroy_userENTRY(lines 2553 2555) the Hoare annotation is: true [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L854 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse0 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (and (or .cse0 (not (<= (+ |old(~ldv_count_2~0)| 5) ~ldv_count_1~0))) (or (not (= |old(~ldv_count_2~0)| 0)) (not (<= 6 ~ldv_count_1~0))) (or .cse0 .cse1) (or (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0)) .cse1))) [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L854 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 2470 2484) the Hoare annotation is: (let ((.cse1 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (and (or .cse0 .cse1 .cse2) (or .cse1 (not (<= (+ |old(~ldv_count_2~0)| 5) ~ldv_count_1~0)) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0))) (or (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0) (not (<= (+ |old(~ldv_count_2~0)| 2) ~ldv_count_1~0)) .cse2) (or (not (= |old(~ldv_count_2~0)| 0)) (not (<= 6 ~ldv_count_1~0)) (= ~ldv_count_2~0 0)) (or (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0)) .cse2))) [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L861 garLoopResultBuilder]: At program point wait_for_completionENTRY(lines 2590 2592) the Hoare annotation is: true [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2021-12-18 02:11:54,985 INFO L858 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L861 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 2545 2547) the Hoare annotation is: true [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2412 2417) the Hoare annotation is: true [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L854 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (let ((.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)))) (and (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse2) (or (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse2))) [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(lines 1658 1665) the Hoare annotation is: (let ((.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)))) (and (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse2) (or (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse2))) [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L854 garLoopResultBuilder]: At program point kmallocENTRY(lines 1649 1656) the Hoare annotation is: (let ((.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)))) (and (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse2) (or (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse2))) [2021-12-18 02:11:54,986 INFO L854 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)))) (and (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse2) (or (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse2))) [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L861 garLoopResultBuilder]: At program point L1646-2(lines 1644 1647) the Hoare annotation is: true [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2021-12-18 02:11:54,986 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L1567(lines 1564 1569) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L1583(lines 1578 1585) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L1575(lines 1570 1577) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point extract_valueENTRY(lines 1676 1683) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L854 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |#valid| |old(#valid)|) [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2226(lines 2201 2236) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2220(lines 2201 2236) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2218(lines 2201 2236) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L861 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L858 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2021-12-18 02:11:54,987 INFO L854 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |#valid| |old(#valid)|) [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point L2582(lines 2581 2583) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L854 garLoopResultBuilder]: At program point ibmpex_bmc_deleteENTRY(lines 2197 2237) the Hoare annotation is: (= |#valid| |old(#valid)|) [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 2424 2429) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L861 garLoopResultBuilder]: At program point ipmi_free_recv_msgENTRY(lines 2556 2558) the Hoare annotation is: true [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1634 1643) the Hoare annotation is: (let ((.cse1 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)))) (and (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse2) (or (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse2))) [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2021-12-18 02:11:54,988 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L861 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L861 garLoopResultBuilder]: At program point L2561(lines 2560 2562) the Hoare annotation is: true [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L854 garLoopResultBuilder]: At program point L2573(lines 2572 2574) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) (and (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse1) (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= 6 ~ldv_count_1~0)) .cse1 (not (= ~ldv_count_2~0 0))))) [2021-12-18 02:11:54,989 INFO L861 garLoopResultBuilder]: At program point L1708(lines 1698 1718) the Hoare annotation is: true [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L854 garLoopResultBuilder]: At program point ibmpex_send_messageENTRY(lines 1695 1719) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) (and (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse1) (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= 6 ~ldv_count_1~0)) .cse1 (not (= ~ldv_count_2~0 0))))) [2021-12-18 02:11:54,989 INFO L854 garLoopResultBuilder]: At program point L1701(lines 1698 1718) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) (and (or (not (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) .cse0 .cse1) (or .cse0 .cse1 .cse2) (or (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1 .cse2) (or (not (<= 6 ~ldv_count_1~0)) .cse1 (not (= ~ldv_count_2~0 0))))) [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L861 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 2539 2541) the Hoare annotation is: true [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2021-12-18 02:11:54,989 INFO L854 garLoopResultBuilder]: At program point L2249-1(lines 2238 2252) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,989 INFO L854 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,989 INFO L858 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2514(lines 2513 2515) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L861 garLoopResultBuilder]: At program point L2316(lines 2302 2320) the Hoare annotation is: true [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2184(lines 2138 2195) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2118(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0) .cse2))) [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2085(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2284(lines 2254 2286) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2384(lines 2379 2386) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L858 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2021-12-18 02:11:54,990 INFO L854 garLoopResultBuilder]: At program point L2550(lines 2549 2551) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,991 INFO L854 garLoopResultBuilder]: At program point L2517(lines 2516 2518) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,991 INFO L861 garLoopResultBuilder]: At program point L2319(lines 2295 2321) the Hoare annotation is: true [2021-12-18 02:11:54,991 INFO L858 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2021-12-18 02:11:54,991 INFO L854 garLoopResultBuilder]: At program point L2122(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,991 INFO L858 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2021-12-18 02:11:54,991 INFO L854 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,991 INFO L858 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2021-12-18 02:11:54,995 INFO L854 garLoopResultBuilder]: At program point L1594(lines 1590 1596) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L854 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2021-12-18 02:11:54,996 INFO L854 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,996 INFO L858 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2021-12-18 02:11:54,997 INFO L854 garLoopResultBuilder]: At program point L2520(lines 2519 2521) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,997 INFO L858 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2021-12-18 02:11:54,997 INFO L854 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,997 INFO L854 garLoopResultBuilder]: At program point L2190(lines 2138 2195) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,997 INFO L854 garLoopResultBuilder]: At program point L2124(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,997 INFO L858 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2021-12-18 02:11:54,997 INFO L858 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2021-12-18 02:11:54,997 INFO L854 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,997 INFO L858 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L854 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,998 INFO L854 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2021-12-18 02:11:54,998 INFO L854 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L854 garLoopResultBuilder]: At program point L2292(lines 2287 2294) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L854 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:54,999 INFO L858 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2021-12-18 02:11:54,999 INFO L854 garLoopResultBuilder]: At program point L1929(lines 1916 1931) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L1863(lines 1849 1869) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L2392(lines 2387 2394) the Hoare annotation is: (let ((.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse9 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse7 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse4 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse5 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse2 .cse3) (and .cse8 .cse5 .cse6 .cse2 .cse9) (and .cse8 .cse1 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse3))) [2021-12-18 02:11:55,000 INFO L858 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L2194(lines 2131 2196) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L2128(lines 2012 2130) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L854 garLoopResultBuilder]: At program point L2095(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,000 INFO L858 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2021-12-18 02:11:55,001 INFO L858 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2021-12-18 02:11:55,001 INFO L858 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2021-12-18 02:11:55,001 INFO L854 garLoopResultBuilder]: At program point L1865(lines 1849 1869) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,001 INFO L854 garLoopResultBuilder]: At program point L1767(lines 1755 1769) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,001 INFO L854 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,001 INFO L858 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2021-12-18 02:11:55,001 INFO L854 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2021-12-18 02:11:55,001 INFO L854 garLoopResultBuilder]: At program point L2527(lines 2526 2528) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,001 INFO L858 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2021-12-18 02:11:55,002 INFO L854 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,003 INFO L854 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,003 INFO L858 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2021-12-18 02:11:55,003 INFO L854 garLoopResultBuilder]: At program point L1868(lines 1842 1870) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,003 INFO L858 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2021-12-18 02:11:55,003 INFO L854 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,004 INFO L858 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2021-12-18 02:11:55,004 INFO L854 garLoopResultBuilder]: At program point L1968(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse2 .cse0 .cse1) (and .cse2 .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,004 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-18 02:11:55,004 INFO L854 garLoopResultBuilder]: At program point L2365(lines 2337 2377) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,004 INFO L858 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2021-12-18 02:11:55,005 INFO L854 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,005 INFO L858 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2021-12-18 02:11:55,005 INFO L858 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2021-12-18 02:11:55,005 INFO L854 garLoopResultBuilder]: At program point L1738(lines 1720 1740) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,005 INFO L854 garLoopResultBuilder]: At program point L2498(lines 2486 2500) the Hoare annotation is: (let ((.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse9 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse7 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse4 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse5 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse2 .cse3) (and .cse8 .cse5 .cse6 .cse2 .cse9) (and .cse8 .cse1 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse3))) [2021-12-18 02:11:55,005 INFO L858 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2021-12-18 02:11:55,005 INFO L854 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,006 INFO L858 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2021-12-18 02:11:55,006 INFO L854 garLoopResultBuilder]: At program point L1970(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse2 .cse0 .cse1) (and .cse2 .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,006 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2564 2566) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2021-12-18 02:11:55,006 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2462 2468) the Hoare annotation is: (let ((.cse4 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (.cse7 (<= 6 ~ldv_count_1~0)) (.cse8 (= ~ldv_count_2~0 0)) (.cse9 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse11 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse3 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse5 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse10 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse4) (and .cse5 .cse7 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse2 .cse3) (and .cse7 .cse1 .cse8 .cse3 .cse9) (and .cse5 .cse6 .cse11 .cse10 .cse2) (and .cse11 .cse1 .cse10 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse10 .cse2))) [2021-12-18 02:11:55,006 INFO L854 garLoopResultBuilder]: At program point L2400(lines 2395 2402) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,006 INFO L858 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2021-12-18 02:11:55,006 INFO L858 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2021-12-18 02:11:55,006 INFO L858 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2021-12-18 02:11:55,006 INFO L858 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2021-12-18 02:11:55,007 INFO L854 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse9 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse7 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse4 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse5 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse2 .cse3) (and .cse8 .cse5 .cse6 .cse2 .cse9) (and .cse8 .cse1 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse3))) [2021-12-18 02:11:55,007 INFO L858 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2021-12-18 02:11:55,007 INFO L854 garLoopResultBuilder]: At program point L1609(lines 1603 1611) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,007 INFO L854 garLoopResultBuilder]: At program point L2369(lines 2337 2377) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,007 INFO L854 garLoopResultBuilder]: At program point L1973(lines 1948 1975) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse2 .cse0 .cse1) (and .cse2 .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2021-12-18 02:11:55,008 INFO L854 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2021-12-18 02:11:55,008 INFO L861 garLoopResultBuilder]: At program point L2569(lines 2568 2570) the Hoare annotation is: true [2021-12-18 02:11:55,008 INFO L861 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2021-12-18 02:11:55,008 INFO L858 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2021-12-18 02:11:55,009 INFO L858 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2021-12-18 02:11:55,009 INFO L854 garLoopResultBuilder]: At program point L2009(lines 1976 2011) the Hoare annotation is: (let ((.cse11 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (.cse12 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse13 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse5 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse7 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse6 (<= 6 ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse8 (= ~ldv_count_2~0 0)) (.cse10 (<= (+ |ULTIMATE.start_create_sensor_#res#1| 12) 0)) (.cse4 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse9 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse4 .cse11 .cse9 .cse10) (and .cse0 .cse5 .cse7 .cse9 .cse10 .cse11) (and .cse5 .cse7 .cse12 .cse2 .cse3) (and .cse13 .cse1 .cse2 .cse4 .cse9) (and .cse13 .cse5 .cse7 .cse2 .cse9) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 (or (and .cse5 .cse7 .cse2 .cse3 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse10))) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse6 .cse1 .cse8 .cse10 .cse4 .cse9))) [2021-12-18 02:11:55,009 INFO L854 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2021-12-18 02:11:55,009 INFO L858 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2021-12-18 02:11:55,009 INFO L858 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2021-12-18 02:11:55,009 INFO L854 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,009 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-18 02:11:55,009 INFO L854 garLoopResultBuilder]: At program point L2076(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (<= 6 ~ldv_count_1~0)) (.cse3 (= ~ldv_count_2~0 0)) (.cse7 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse11 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse5 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse10 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse9 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1)) (.cse0 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse2 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse6 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse6) (and .cse1 .cse7 .cse3 .cse4) (and .cse8 .cse9 .cse7 .cse6) (and .cse5 .cse7 .cse10 .cse4) (and .cse5 .cse7 .cse6) (and .cse11 .cse7 .cse6) (and .cse0 .cse2 .cse11 .cse6) (and .cse5 .cse0 .cse2 .cse4 .cse10) (and .cse8 .cse9 .cse0 .cse2 .cse6))) [2021-12-18 02:11:55,010 INFO L858 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2021-12-18 02:11:55,010 INFO L854 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,010 INFO L858 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2021-12-18 02:11:55,010 INFO L858 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2021-12-18 02:11:55,010 INFO L861 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2021-12-18 02:11:55,010 INFO L854 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,010 INFO L854 garLoopResultBuilder]: At program point L1945(lines 1932 1947) the Hoare annotation is: (let ((.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse7 (<= 6 ~ldv_count_1~0)) (.cse8 (= ~ldv_count_2~0 0)) (.cse5 (= |ULTIMATE.start_is_temp_sensor_#res#1| 0)) (.cse4 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse1 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse3 (= |ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1#1| 0)) (.cse6 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5 .cse6) (and .cse4 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse2 .cse3) (and .cse7 .cse1 .cse8 .cse3) (and .cse0 .cse2 .cse3 .cse5) (and .cse7 .cse8 .cse3 .cse5) (and .cse4 .cse1 .cse3 .cse6))) [2021-12-18 02:11:55,010 INFO L854 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,011 INFO L858 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2021-12-18 02:11:55,011 INFO L854 garLoopResultBuilder]: At program point L2408(lines 2403 2410) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,011 INFO L858 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2021-12-18 02:11:55,011 INFO L854 garLoopResultBuilder]: At program point L2078(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (<= 6 ~ldv_count_1~0)) (.cse3 (= ~ldv_count_2~0 0)) (.cse5 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse6 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse12 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (.cse9 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse8 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse10 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse11 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1)) (.cse0 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse2 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse7 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse5 .cse7 .cse8) (and .cse1 .cse5 .cse3 .cse4) (and .cse10 .cse11 .cse5 .cse7) (and .cse9 .cse5 .cse12 .cse4) (and .cse0 .cse2 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse4 .cse12) (and .cse9 .cse0 .cse2 .cse7 .cse8) (and .cse10 .cse11 .cse0 .cse2 .cse7))) [2021-12-18 02:11:55,012 INFO L858 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2021-12-18 02:11:55,012 INFO L858 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2021-12-18 02:11:55,012 INFO L861 garLoopResultBuilder]: At program point L2376(lines 2327 2378) the Hoare annotation is: true [2021-12-18 02:11:55,012 INFO L858 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2021-12-18 02:11:55,012 INFO L854 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,012 INFO L854 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0) .cse2))) [2021-12-18 02:11:55,012 INFO L858 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2021-12-18 02:11:55,013 INFO L858 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2021-12-18 02:11:55,013 INFO L858 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2021-12-18 02:11:55,013 INFO L858 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2021-12-18 02:11:55,013 INFO L854 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0) .cse2))) [2021-12-18 02:11:55,013 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 02:11:55,013 INFO L854 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,014 INFO L854 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,014 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-12-18 02:11:55,014 INFO L861 garLoopResultBuilder]: At program point L2576(lines 2575 2577) the Hoare annotation is: true [2021-12-18 02:11:55,014 INFO L854 garLoopResultBuilder]: At program point L2510(lines 2501 2512) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2021-12-18 02:11:55,015 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-12-18 02:11:55,015 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,015 INFO L854 garLoopResultBuilder]: At program point L2543-2(lines 2542 2544) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,015 INFO L854 garLoopResultBuilder]: At program point L2114(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0) .cse2))) [2021-12-18 02:11:55,015 INFO L854 garLoopResultBuilder]: At program point L2081(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,015 INFO L858 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2021-12-18 02:11:55,015 INFO L858 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2021-12-18 02:11:55,016 INFO L854 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse13 (<= (+ ~ldv_count_2~0 2) ~ldv_count_1~0)) (.cse1 (= 2 |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1|)) (.cse4 (= 2 |ULTIMATE.start_create_sensor_~type#1|)) (.cse9 (<= 6 ~ldv_count_1~0)) (.cse10 (= ~ldv_count_2~0 0)) (.cse8 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse7 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse5 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse6 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1)) (.cse11 (= 1 |ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2#1|)) (.cse12 (= 1 |ULTIMATE.start_is_temp_sensor_#res#1|)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8) (and .cse11 .cse12 .cse13 .cse2 .cse3) (and .cse13 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse11 .cse12 .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse8 .cse7) (and .cse0 .cse11 .cse12 .cse2 .cse3) (and .cse5 .cse6 .cse11 .cse12 .cse2))) [2021-12-18 02:11:55,016 INFO L858 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2021-12-18 02:11:55,016 INFO L854 garLoopResultBuilder]: At program point L1752(lines 1741 1754) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,016 INFO L861 garLoopResultBuilder]: At program point L2314(lines 2302 2320) the Hoare annotation is: true [2021-12-18 02:11:55,016 INFO L854 garLoopResultBuilder]: At program point L2116(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,016 INFO L854 garLoopResultBuilder]: At program point L2083(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= (+ ~ldv_count_2~0 5) ~ldv_count_1~0)))) [2021-12-18 02:11:55,016 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2021-12-18 02:11:55,016 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2021-12-18 02:11:55,017 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 2536 2538) the Hoare annotation is: true [2021-12-18 02:11:55,019 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 02:11:55,020 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 02:11:55,044 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:11:55 BoogieIcfgContainer [2021-12-18 02:11:55,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 02:11:55,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 02:11:55,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 02:11:55,079 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 02:11:55,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:08:35" (3/4) ... [2021-12-18 02:11:55,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2021-12-18 02:11:55,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2021-12-18 02:11:55,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-12-18 02:11:55,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2021-12-18 02:11:55,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-12-18 02:11:55,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-12-18 02:11:55,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-18 02:11:55,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 02:11:55,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 02:11:55,135 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || (((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) && \result + 12 <= 0)) || (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && 2 == type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0) && \result + 12 <= 0)) || (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && \result + 12 <= 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || (ldv_count_2 + 1 <= ldv_count_1 && (((((1 == tmp___0 && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && \result + 12 <= 0) || ((((2 == sensor_type && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) && \result + 12 <= 0)))) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && \result + 12 <= 0) && 2 == type) && j == 0) [2021-12-18 02:11:55,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && j <= 2) && 2 == type) && ldv_count_2 + 5 <= ldv_count_1) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j <= 2) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && 2 == type) && j == 0)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) [2021-12-18 02:11:55,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && j == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0)) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) [2021-12-18 02:11:55,136 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) || (((2 == sensor_type && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && j == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) [2021-12-18 02:11:55,137 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_count_2 + 5 <= ldv_count_1) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && ((!(1 <= ldv_call_dev_attr_of_sensor_device_attribute) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(ldv_count_2 + 1 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(6 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(ldv_count_2 == 0)) [2021-12-18 02:11:55,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) [2021-12-18 02:11:55,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_count_2 + 5 <= ldv_count_1) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && ((!(1 <= ldv_call_dev_attr_of_sensor_device_attribute) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(ldv_count_2 + 1 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(6 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(ldv_count_2 == 0)) [2021-12-18 02:11:55,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) [2021-12-18 02:11:55,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && tmp___1 == 0) && \result == 0) && ldv_count_2 + 5 <= ldv_count_1)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) && \result == 0)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0)) || (((6 <= ldv_count_1 && 1 == \result) && ldv_count_2 == 0) && tmp___1 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) && \result == 0)) || (((6 <= ldv_count_1 && ldv_count_2 == 0) && tmp___1 == 0) && \result == 0)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == \result) && tmp___1 == 0) && ldv_count_2 + 5 <= ldv_count_1) [2021-12-18 02:11:55,205 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 02:11:55,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 02:11:55,205 INFO L158 Benchmark]: Toolchain (without parser) took 201921.76ms. Allocated memory was 96.5MB in the beginning and 828.4MB in the end (delta: 731.9MB). Free memory was 61.5MB in the beginning and 497.5MB in the end (delta: -436.0MB). Peak memory consumption was 297.2MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,205 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 02:11:55,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.91ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 61.2MB in the beginning and 75.8MB in the end (delta: -14.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.26ms. Allocated memory is still 136.3MB. Free memory was 75.8MB in the beginning and 68.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,206 INFO L158 Benchmark]: Boogie Preprocessor took 79.12ms. Allocated memory is still 136.3MB. Free memory was 68.2MB in the beginning and 61.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,207 INFO L158 Benchmark]: RCFGBuilder took 936.09ms. Allocated memory is still 136.3MB. Free memory was 61.1MB in the beginning and 98.2MB in the end (delta: -37.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,207 INFO L158 Benchmark]: TraceAbstraction took 199910.26ms. Allocated memory was 136.3MB in the beginning and 828.4MB in the end (delta: 692.1MB). Free memory was 97.7MB in the beginning and 525.3MB in the end (delta: -427.6MB). Peak memory consumption was 507.8MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,207 INFO L158 Benchmark]: Witness Printer took 126.35ms. Allocated memory is still 828.4MB. Free memory was 525.3MB in the beginning and 497.5MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-18 02:11:55,212 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.91ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 61.2MB in the beginning and 75.8MB in the end (delta: -14.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.26ms. Allocated memory is still 136.3MB. Free memory was 75.8MB in the beginning and 68.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.12ms. Allocated memory is still 136.3MB. Free memory was 68.2MB in the beginning and 61.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 936.09ms. Allocated memory is still 136.3MB. Free memory was 61.1MB in the beginning and 98.2MB in the end (delta: -37.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 199910.26ms. Allocated memory was 136.3MB in the beginning and 828.4MB in the end (delta: 692.1MB). Free memory was 97.7MB in the beginning and 525.3MB in the end (delta: -427.6MB). Peak memory consumption was 507.8MB. Max. memory is 16.1GB. * Witness Printer took 126.35ms. Allocated memory is still 828.4MB. Free memory was 525.3MB in the beginning and 497.5MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: 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 18 procedures, 275 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 199.8s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 182.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9479 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8848 mSDsluCounter, 23101 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15876 mSDsCounter, 3123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7783 IncrementalHoareTripleChecker+Invalid, 10906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3123 mSolverCounterUnsat, 7225 mSDtfsCounter, 7783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1187 GetRequests, 1087 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=11, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 10269 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 4433 PreInvPairs, 6236 NumberOfFragments, 4606 HoareAnnotationTreeSize, 4433 FomulaSimplifications, 1515898 FormulaSimplificationTreeSizeReduction, 158.6s HoareSimplificationTime, 134 FomulaSimplificationsInter, 28335172 FormulaSimplificationTreeSizeReductionInter, 23.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2740 NumberOfCodeBlocks, 2740 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2909 ConstructedInterpolants, 0 QuantifiedInterpolants, 4764 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3396 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1342/1346 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: 2287]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: 1644]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2549]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0)) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2572]: Loop Invariant [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((!(ldv_count_2 + 5 <= ldv_count_1) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && ((!(1 <= ldv_call_dev_attr_of_sensor_device_attribute) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(ldv_count_2 + 1 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(6 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2131]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2513]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1948]: Loop Invariant Derived loop invariant: ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0)) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((((((((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && j == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0)) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) - InvariantResult [Line: 1570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: (((((((((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && tmp___1 == 0) && \result == 0) && ldv_count_2 + 5 <= ldv_count_1)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) && \result == 0)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0)) || (((6 <= ldv_count_1 && 1 == \result) && ldv_count_2 == 0) && tmp___1 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && tmp___1 == 0) && \result == 0)) || (((6 <= ldv_count_1 && ldv_count_2 == 0) && tmp___1 == 0) && \result == 0)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == \result) && tmp___1 == 0) && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2560]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2519]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2526]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || (((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) && \result + 12 <= 0)) || (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && 2 == type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0) && \result + 12 <= 0)) || (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && \result + 12 <= 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || (ldv_count_2 + 1 <= ldv_count_1 && (((((1 == tmp___0 && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && \result + 12 <= 0) || ((((2 == sensor_type && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) && \result + 12 <= 0)))) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && \result + 12 <= 0) && 2 == type) && j == 0) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2501]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && j <= 2) && ldv_count_2 + 5 <= ldv_count_1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((6 <= ldv_count_1 && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2516]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((((((((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0) || (((2 == sensor_type && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || (((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && j == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) && j == 0)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j == 0) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && j <= 1) && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) - InvariantResult [Line: 1755]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2012]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1916]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1741]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2254]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && j <= 2) && ldv_count_2 + 5 <= ldv_count_1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((6 <= ldv_count_1 && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2462]: Loop Invariant Derived loop invariant: ((((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && j <= 2) && 2 == type) && ldv_count_2 + 5 <= ldv_count_1) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && j <= 2) && ldv_count_2 + 5 <= ldv_count_1)) || ((((1 == tmp___0 && 6 <= ldv_count_1) && 1 == \result) && ldv_count_2 == 0) && j == 0)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0) && 2 == type) && j == 0)) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) - InvariantResult [Line: 2295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1698]: Loop Invariant [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 02:11:55,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((!(ldv_count_2 + 5 <= ldv_count_1) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && ((!(1 <= ldv_call_dev_attr_of_sensor_device_attribute) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(ldv_count_2 + 1 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || 0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && ((!(6 <= ldv_count_1) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((6 <= ldv_count_1 && 2 == sensor_type) && ldv_count_2 == 0)) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2327]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2387]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2395]: Loop Invariant Derived loop invariant: (((1 <= ldv_call_dev_attr_of_sensor_device_attribute && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (1 <= ldv_call_dev_attr_of_sensor_device_attribute && ldv_count_2 + 5 <= ldv_count_1) - InvariantResult [Line: 2486]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type) || ((((1 == tmp___0 && 1 == \result) && ldv_count_2 + 2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j == 0)) || ((((ldv_count_2 + 1 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && 2 == type) && j == 0)) || ((((ldv_count_2 + 2 <= ldv_count_1 && 2 == sensor_type) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) && 2 == type)) || ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute && 1 == tmp___0) && 1 == \result) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) && j <= 2) - InvariantResult [Line: 2581]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-18 02:11:55,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE