./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:30:18,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:30:18,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:30:18,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:30:18,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:30:18,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:30:18,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:30:18,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:30:18,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:30:18,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:30:18,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:30:18,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:30:18,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:30:18,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:30:18,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:30:18,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:30:18,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:30:18,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:30:18,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:30:18,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:30:18,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:30:18,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:30:18,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:30:18,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:30:18,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:30:18,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:30:18,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:30:18,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:30:18,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:30:18,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:30:18,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:30:18,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:30:18,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:30:18,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:30:18,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:30:18,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:30:18,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:30:18,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:30:18,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:30:18,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:30:18,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:30:18,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 11:30:18,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:30:18,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:30:18,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:30:18,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:30:18,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:30:18,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:30:18,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:30:18,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:30:18,535 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:30:18,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:30:18,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:30:18,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:30:18,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:30:18,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:30:18,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:30:18,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:30:18,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:30:18,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:30:18,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:30:18,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:30:18,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:30:18,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:30:18,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:30:18,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:30:18,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:30:18,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:30:18,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:30:18,542 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:30:18,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:30:18,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:30:18,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 11:30:18,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:30:18,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:30:18,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:30:18,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:30:18,836 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:30:18,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2022-11-20 11:30:21,905 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:30:22,263 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:30:22,264 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2022-11-20 11:30:22,294 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/data/64a2db2c7/a31d0cd234694777a4422d7f70879f98/FLAG25026d0ff [2022-11-20 11:30:22,315 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/data/64a2db2c7/a31d0cd234694777a4422d7f70879f98 [2022-11-20 11:30:22,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:30:22,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:30:22,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:30:22,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:30:22,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:30:22,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:30:22" (1/1) ... [2022-11-20 11:30:22,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38555a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:22, skipping insertion in model container [2022-11-20 11:30:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:30:22" (1/1) ... [2022-11-20 11:30:22,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:30:22,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:30:23,099 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2022-11-20 11:30:23,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:30:23,142 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:30:23,268 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2022-11-20 11:30:23,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:30:23,310 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:30:23,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23 WrapperNode [2022-11-20 11:30:23,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:30:23,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:30:23,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:30:23,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:30:23,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,413 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 1101 [2022-11-20 11:30:23,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:30:23,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:30:23,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:30:23,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:30:23,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:30:23,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:30:23,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:30:23,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:30:23,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (1/1) ... [2022-11-20 11:30:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:30:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:23,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:30:23,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:30:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-20 11:30:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-20 11:30:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-20 11:30:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:30:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 11:30:23,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 11:30:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 11:30:23,649 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 11:30:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:30:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 11:30:23,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 11:30:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2022-11-20 11:30:23,649 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2022-11-20 11:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2022-11-20 11:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2022-11-20 11:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-11-20 11:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-11-20 11:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-20 11:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2022-11-20 11:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2022-11-20 11:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:30:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-20 11:30:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-20 11:30:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2022-11-20 11:30:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2022-11-20 11:30:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-20 11:30:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-20 11:30:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:30:23,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:30:23,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 11:30:23,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 11:30:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-20 11:30:23,656 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-20 11:30:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-20 11:30:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-20 11:30:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-20 11:30:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-20 11:30:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:30:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-11-20 11:30:23,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-11-20 11:30:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2022-11-20 11:30:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2022-11-20 11:30:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-20 11:30:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-20 11:30:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-20 11:30:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:30:23,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:30:24,038 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:30:24,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:30:25,272 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:30:25,291 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:30:25,292 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:30:25,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:30:25 BoogieIcfgContainer [2022-11-20 11:30:25,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:30:25,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:30:25,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:30:25,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:30:25,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:30:22" (1/3) ... [2022-11-20 11:30:25,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39236793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:30:25, skipping insertion in model container [2022-11-20 11:30:25,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:23" (2/3) ... [2022-11-20 11:30:25,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39236793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:30:25, skipping insertion in model container [2022-11-20 11:30:25,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:30:25" (3/3) ... [2022-11-20 11:30:25,309 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2022-11-20 11:30:25,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:30:25,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:30:25,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:30:25,411 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@241ca19a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:30:25,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:30:25,420 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) [2022-11-20 11:30:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-20 11:30:25,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:25,454 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:25,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1527877958, now seen corresponding path program 1 times [2022-11-20 11:30:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:25,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291470687] [2022-11-20 11:30:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:30:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:30:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 11:30:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 11:30:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:30:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:26,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:26,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291470687] [2022-11-20 11:30:26,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291470687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:26,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522441594] [2022-11-20 11:30:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:26,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:26,502 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) [2022-11-20 11:30:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:28,260 INFO L93 Difference]: Finished difference Result 678 states and 930 transitions. [2022-11-20 11:30:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:30:28,268 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 [2022-11-20 11:30:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:28,282 INFO L225 Difference]: With dead ends: 678 [2022-11-20 11:30:28,282 INFO L226 Difference]: Without dead ends: 375 [2022-11-20 11:30:28,288 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:28,295 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 336 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:28,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1286 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 11:30:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-20 11:30:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 263. [2022-11-20 11:30:28,368 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) [2022-11-20 11:30:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2022-11-20 11:30:28,373 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 122 [2022-11-20 11:30:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:28,374 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2022-11-20 11:30:28,374 INFO L496 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) [2022-11-20 11:30:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2022-11-20 11:30:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 11:30:28,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:28,380 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:30:28,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1747602214, now seen corresponding path program 1 times [2022-11-20 11:30:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389087777] [2022-11-20 11:30:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389087777] [2022-11-20 11:30:28,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389087777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:28,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:28,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:30:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185472171] [2022-11-20 11:30:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:30:28,751 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) [2022-11-20 11:30:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:29,715 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-11-20 11:30:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:30:29,716 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 [2022-11-20 11:30:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:29,719 INFO L225 Difference]: With dead ends: 548 [2022-11-20 11:30:29,720 INFO L226 Difference]: Without dead ends: 293 [2022-11-20 11:30:29,721 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:29,722 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 166 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:29,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 751 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 11:30:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-20 11:30:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2022-11-20 11:30:29,761 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) [2022-11-20 11:30:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 347 transitions. [2022-11-20 11:30:29,766 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 347 transitions. Word has length 130 [2022-11-20 11:30:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:29,769 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 347 transitions. [2022-11-20 11:30:29,770 INFO L496 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) [2022-11-20 11:30:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 347 transitions. [2022-11-20 11:30:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 11:30:29,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:29,776 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:29,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:30:29,777 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -329734684, now seen corresponding path program 1 times [2022-11-20 11:30:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:29,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385688305] [2022-11-20 11:30:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:30,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385688305] [2022-11-20 11:30:30,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385688305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:30,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129375790] [2022-11-20 11:30:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:30,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:30,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:30,257 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) [2022-11-20 11:30:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:31,458 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2022-11-20 11:30:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:30:31,459 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 [2022-11-20 11:30:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:31,463 INFO L225 Difference]: With dead ends: 627 [2022-11-20 11:30:31,463 INFO L226 Difference]: Without dead ends: 371 [2022-11-20 11:30:31,464 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:31,465 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 319 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:31,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1196 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 11:30:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-20 11:30:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 266. [2022-11-20 11:30:31,493 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) [2022-11-20 11:30:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2022-11-20 11:30:31,495 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 130 [2022-11-20 11:30:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:31,496 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2022-11-20 11:30:31,496 INFO L496 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) [2022-11-20 11:30:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2022-11-20 11:30:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 11:30:31,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:31,499 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:31,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:30:31,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1056468710, now seen corresponding path program 1 times [2022-11-20 11:30:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:31,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912849001] [2022-11-20 11:30:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:32,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912849001] [2022-11-20 11:30:32,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912849001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:32,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:32,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:30:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129508355] [2022-11-20 11:30:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:30:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:30:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:30:32,198 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) [2022-11-20 11:30:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:34,391 INFO L93 Difference]: Finished difference Result 863 states and 1155 transitions. [2022-11-20 11:30:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:30:34,392 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 [2022-11-20 11:30:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:34,399 INFO L225 Difference]: With dead ends: 863 [2022-11-20 11:30:34,399 INFO L226 Difference]: Without dead ends: 859 [2022-11-20 11:30:34,400 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:34,401 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 1132 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:34,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1248 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-20 11:30:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-11-20 11:30:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 772. [2022-11-20 11:30:34,522 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) [2022-11-20 11:30:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2022-11-20 11:30:34,528 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1021 transitions. Word has length 130 [2022-11-20 11:30:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:34,530 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1021 transitions. [2022-11-20 11:30:34,531 INFO L496 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) [2022-11-20 11:30:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1021 transitions. [2022-11-20 11:30:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-20 11:30:34,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:34,537 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:30:34,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash 88761714, now seen corresponding path program 1 times [2022-11-20 11:30:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:34,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28014296] [2022-11-20 11:30:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:34,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:30:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:35,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28014296] [2022-11-20 11:30:35,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28014296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029695747] [2022-11-20 11:30:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:35,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:35,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:30:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:35,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:30:35,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 11:30:35,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:35,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029695747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:35,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:35,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-20 11:30:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720235924] [2022-11-20 11:30:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:35,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:30:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:30:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:30:35,691 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) [2022-11-20 11:30:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:35,834 INFO L93 Difference]: Finished difference Result 1538 states and 2037 transitions. [2022-11-20 11:30:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:30:35,835 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 [2022-11-20 11:30:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:35,842 INFO L225 Difference]: With dead ends: 1538 [2022-11-20 11:30:35,842 INFO L226 Difference]: Without dead ends: 1280 [2022-11-20 11:30:35,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:30:35,845 INFO L413 NwaCegarLoop]: 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 [2022-11-20 11:30:35,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:30:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-20 11:30:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1025. [2022-11-20 11:30:35,928 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) [2022-11-20 11:30:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1354 transitions. [2022-11-20 11:30:35,934 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1354 transitions. Word has length 140 [2022-11-20 11:30:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 1354 transitions. [2022-11-20 11:30:35,935 INFO L496 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) [2022-11-20 11:30:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1354 transitions. [2022-11-20 11:30:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-20 11:30:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:35,939 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:35,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:36,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:36,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1821132084, now seen corresponding path program 1 times [2022-11-20 11:30:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:36,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890049129] [2022-11-20 11:30:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 11:30:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 11:30:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890049129] [2022-11-20 11:30:36,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890049129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:36,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:36,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589978956] [2022-11-20 11:30:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:36,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:36,628 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) [2022-11-20 11:30:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:38,083 INFO L93 Difference]: Finished difference Result 2698 states and 3689 transitions. [2022-11-20 11:30:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:30:38,084 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 [2022-11-20 11:30:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:38,096 INFO L225 Difference]: With dead ends: 2698 [2022-11-20 11:30:38,096 INFO L226 Difference]: Without dead ends: 1681 [2022-11-20 11:30:38,103 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:38,107 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 302 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:38,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1488 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 11:30:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2022-11-20 11:30:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1033. [2022-11-20 11:30:38,226 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) [2022-11-20 11:30:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1362 transitions. [2022-11-20 11:30:38,233 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1362 transitions. Word has length 184 [2022-11-20 11:30:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1362 transitions. [2022-11-20 11:30:38,234 INFO L496 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) [2022-11-20 11:30:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1362 transitions. [2022-11-20 11:30:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-20 11:30:38,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:38,239 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:38,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:30:38,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1580348874, now seen corresponding path program 1 times [2022-11-20 11:30:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970044122] [2022-11-20 11:30:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 11:30:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 11:30:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:38,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970044122] [2022-11-20 11:30:38,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970044122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:38,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:38,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:30:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024230534] [2022-11-20 11:30:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:30:38,633 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) [2022-11-20 11:30:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:39,700 INFO L93 Difference]: Finished difference Result 2178 states and 2895 transitions. [2022-11-20 11:30:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:30:39,701 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 [2022-11-20 11:30:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:39,708 INFO L225 Difference]: With dead ends: 2178 [2022-11-20 11:30:39,708 INFO L226 Difference]: Without dead ends: 1153 [2022-11-20 11:30:39,711 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:39,713 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 166 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:39,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 753 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 11:30:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-11-20 11:30:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1037. [2022-11-20 11:30:39,809 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) [2022-11-20 11:30:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1366 transitions. [2022-11-20 11:30:39,815 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1366 transitions. Word has length 184 [2022-11-20 11:30:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:39,816 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1366 transitions. [2022-11-20 11:30:39,816 INFO L496 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) [2022-11-20 11:30:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1366 transitions. [2022-11-20 11:30:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-20 11:30:39,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:39,821 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:39,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:30:39,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 347923828, now seen corresponding path program 1 times [2022-11-20 11:30:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:39,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656785068] [2022-11-20 11:30:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 11:30:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 11:30:40,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:40,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656785068] [2022-11-20 11:30:40,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656785068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:40,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:40,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263877267] [2022-11-20 11:30:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:40,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:40,373 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) [2022-11-20 11:30:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:42,165 INFO L93 Difference]: Finished difference Result 3838 states and 5391 transitions. [2022-11-20 11:30:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:30:42,166 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 [2022-11-20 11:30:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:42,180 INFO L225 Difference]: With dead ends: 3838 [2022-11-20 11:30:42,180 INFO L226 Difference]: Without dead ends: 2809 [2022-11-20 11:30:42,183 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:42,185 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 647 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:42,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2011 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 11:30:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-11-20 11:30:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1045. [2022-11-20 11:30:42,321 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) [2022-11-20 11:30:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1374 transitions. [2022-11-20 11:30:42,327 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1374 transitions. Word has length 184 [2022-11-20 11:30:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:42,327 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1374 transitions. [2022-11-20 11:30:42,328 INFO L496 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) [2022-11-20 11:30:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1374 transitions. [2022-11-20 11:30:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-20 11:30:42,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:42,331 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:42,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:30:42,332 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 830531558, now seen corresponding path program 1 times [2022-11-20 11:30:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:42,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360743972] [2022-11-20 11:30:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 11:30:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-20 11:30:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:42,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360743972] [2022-11-20 11:30:42,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360743972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:42,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:42,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706474619] [2022-11-20 11:30:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:42,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:42,830 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) [2022-11-20 11:30:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:44,832 INFO L93 Difference]: Finished difference Result 3946 states and 5543 transitions. [2022-11-20 11:30:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:30:44,833 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 [2022-11-20 11:30:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:44,848 INFO L225 Difference]: With dead ends: 3946 [2022-11-20 11:30:44,848 INFO L226 Difference]: Without dead ends: 2909 [2022-11-20 11:30:44,853 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:44,854 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 748 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:44,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1877 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 11:30:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2022-11-20 11:30:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1124. [2022-11-20 11:30:45,064 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) [2022-11-20 11:30:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1483 transitions. [2022-11-20 11:30:45,078 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1483 transitions. Word has length 185 [2022-11-20 11:30:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:45,079 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1483 transitions. [2022-11-20 11:30:45,079 INFO L496 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) [2022-11-20 11:30:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1483 transitions. [2022-11-20 11:30:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-20 11:30:45,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:45,083 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:45,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:30:45,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1883377874, now seen corresponding path program 1 times [2022-11-20 11:30:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:45,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408006166] [2022-11-20 11:30:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 11:30:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 11:30:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:45,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408006166] [2022-11-20 11:30:45,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408006166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:45,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:45,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508027717] [2022-11-20 11:30:45,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:45,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:45,520 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) [2022-11-20 11:30:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:47,737 INFO L93 Difference]: Finished difference Result 4208 states and 5903 transitions. [2022-11-20 11:30:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:30:47,738 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 [2022-11-20 11:30:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:47,758 INFO L225 Difference]: With dead ends: 4208 [2022-11-20 11:30:47,759 INFO L226 Difference]: Without dead ends: 3092 [2022-11-20 11:30:47,764 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:47,765 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 697 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:47,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2208 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 11:30:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-11-20 11:30:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1132. [2022-11-20 11:30:47,971 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) [2022-11-20 11:30:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1491 transitions. [2022-11-20 11:30:47,976 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1491 transitions. Word has length 185 [2022-11-20 11:30:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:47,977 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1491 transitions. [2022-11-20 11:30:47,978 INFO L496 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) [2022-11-20 11:30:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1491 transitions. [2022-11-20 11:30:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-20 11:30:47,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:47,981 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:47,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:30:47,982 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -124338905, now seen corresponding path program 1 times [2022-11-20 11:30:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:47,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301545416] [2022-11-20 11:30:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 11:30:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-20 11:30:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:48,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301545416] [2022-11-20 11:30:48,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301545416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130327383] [2022-11-20 11:30:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:48,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:48,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:30:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:49,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:30:49,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-20 11:30:49,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:30:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-20 11:30:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130327383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:30:49,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:30:49,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-11-20 11:30:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687517083] [2022-11-20 11:30:49,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:30:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:30:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:30:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:30:49,416 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) [2022-11-20 11:30:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:51,065 INFO L93 Difference]: Finished difference Result 3782 states and 5259 transitions. [2022-11-20 11:30:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:30:51,066 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 [2022-11-20 11:30:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:51,080 INFO L225 Difference]: With dead ends: 3782 [2022-11-20 11:30:51,081 INFO L226 Difference]: Without dead ends: 2658 [2022-11-20 11:30:51,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:30:51,085 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 677 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:51,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1487 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:30:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-11-20 11:30:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1508. [2022-11-20 11:30:51,302 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) [2022-11-20 11:30:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2011 transitions. [2022-11-20 11:30:51,309 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2011 transitions. Word has length 186 [2022-11-20 11:30:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:51,309 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2011 transitions. [2022-11-20 11:30:51,310 INFO L496 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) [2022-11-20 11:30:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2011 transitions. [2022-11-20 11:30:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-20 11:30:51,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:51,314 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:51,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:51,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248058, now seen corresponding path program 1 times [2022-11-20 11:30:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628574362] [2022-11-20 11:30:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 11:30:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 11:30:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-20 11:30:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:51,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628574362] [2022-11-20 11:30:51,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628574362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:51,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:51,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:30:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656165922] [2022-11-20 11:30:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:51,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:30:51,933 INFO L87 Difference]: Start difference. First operand 1508 states and 2011 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 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) [2022-11-20 11:30:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:53,705 INFO L93 Difference]: Finished difference Result 2373 states and 3203 transitions. [2022-11-20 11:30:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:30:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 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 [2022-11-20 11:30:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:53,712 INFO L225 Difference]: With dead ends: 2373 [2022-11-20 11:30:53,712 INFO L226 Difference]: Without dead ends: 1220 [2022-11-20 11:30:53,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:30:53,716 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 453 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:53,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1264 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 11:30:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-11-20 11:30:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1128. [2022-11-20 11:30:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 908 states have (on average 1.263215859030837) internal successors, (1147), 915 states have internal predecessors, (1147), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2022-11-20 11:30:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1489 transitions. [2022-11-20 11:30:53,853 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1489 transitions. Word has length 198 [2022-11-20 11:30:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1489 transitions. [2022-11-20 11:30:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 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) [2022-11-20 11:30:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1489 transitions. [2022-11-20 11:30:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-20 11:30:53,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:53,859 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:53,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:30:53,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash -829148697, now seen corresponding path program 1 times [2022-11-20 11:30:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:53,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604966075] [2022-11-20 11:30:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 11:30:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 11:30:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 11:30:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-20 11:30:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604966075] [2022-11-20 11:30:54,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604966075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:54,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:54,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230126520] [2022-11-20 11:30:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:54,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:54,303 INFO L87 Difference]: Start difference. First operand 1128 states and 1489 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) [2022-11-20 11:30:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:55,949 INFO L93 Difference]: Finished difference Result 3214 states and 4411 transitions. [2022-11-20 11:30:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:30:55,950 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 [2022-11-20 11:30:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:55,960 INFO L225 Difference]: With dead ends: 3214 [2022-11-20 11:30:55,961 INFO L226 Difference]: Without dead ends: 2094 [2022-11-20 11:30:55,965 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:30:55,966 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 502 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:55,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1613 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:30:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-11-20 11:30:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1134. [2022-11-20 11:30:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 914 states have (on average 1.2614879649890591) internal successors, (1153), 921 states have internal predecessors, (1153), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2022-11-20 11:30:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1495 transitions. [2022-11-20 11:30:56,172 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1495 transitions. Word has length 220 [2022-11-20 11:30:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:56,173 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1495 transitions. [2022-11-20 11:30:56,173 INFO L496 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) [2022-11-20 11:30:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1495 transitions. [2022-11-20 11:30:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-11-20 11:30:56,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:56,179 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:56,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:30:56,179 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1357206825, now seen corresponding path program 1 times [2022-11-20 11:30:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:56,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867831331] [2022-11-20 11:30:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 11:30:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 11:30:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-20 11:30:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-11-20 11:30:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:56,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867831331] [2022-11-20 11:30:56,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867831331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:56,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:30:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375080985] [2022-11-20 11:30:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:56,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:56,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:30:56,687 INFO L87 Difference]: Start difference. First operand 1134 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-20 11:30:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:58,200 INFO L93 Difference]: Finished difference Result 2163 states and 2861 transitions. [2022-11-20 11:30:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:30:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 236 [2022-11-20 11:30:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:58,207 INFO L225 Difference]: With dead ends: 2163 [2022-11-20 11:30:58,207 INFO L226 Difference]: Without dead ends: 1037 [2022-11-20 11:30:58,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:30:58,210 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 544 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:58,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 778 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:30:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-11-20 11:30:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 947. [2022-11-20 11:30:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 747 states have (on average 1.2449799196787148) internal successors, (930), 754 states have internal predecessors, (930), 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) [2022-11-20 11:30:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1232 transitions. [2022-11-20 11:30:58,346 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1232 transitions. Word has length 236 [2022-11-20 11:30:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:58,347 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1232 transitions. [2022-11-20 11:30:58,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-20 11:30:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1232 transitions. [2022-11-20 11:30:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-11-20 11:30:58,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:58,351 INFO L195 NwaCegarLoop]: 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] [2022-11-20 11:30:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:30:58,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:30:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 533574185, now seen corresponding path program 2 times [2022-11-20 11:30:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279167535] [2022-11-20 11:30:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:30:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:30:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 11:30:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:30:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:30:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:30:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 11:30:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 11:30:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:30:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:30:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 11:30:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:30:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 11:30:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 11:30:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-20 11:30:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:30:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-20 11:30:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279167535] [2022-11-20 11:30:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279167535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:59,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:59,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:30:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86653506] [2022-11-20 11:30:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:59,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:30:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:30:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:30:59,306 INFO L87 Difference]: Start difference. First operand 947 states and 1232 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) [2022-11-20 11:31:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:00,978 INFO L93 Difference]: Finished difference Result 1373 states and 1820 transitions. [2022-11-20 11:31:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:31:00,979 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 [2022-11-20 11:31:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:00,980 INFO L225 Difference]: With dead ends: 1373 [2022-11-20 11:31:00,980 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:31:00,985 INFO L412 NwaCegarLoop]: 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 [2022-11-20 11:31:00,986 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 879 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:00,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 806 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:31:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:31:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:31:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:31:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:31:00,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2022-11-20 11:31:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:00,988 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:31:00,989 INFO L496 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) [2022-11-20 11:31:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:31:00,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:31:00,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:31:00,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:31:00,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:34:16,447 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2022-11-20 11:34:16,448 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1) (or .cse0 .cse2 .cse1) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2 .cse1))) [2022-11-20 11:34:16,448 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2022-11-20 11:34:16,448 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2022-11-20 11:34:16,448 INFO L902 garLoopResultBuilder]: At program point ipmi_destroy_userENTRY(lines 2553 2555) the Hoare annotation is: true [2022-11-20 11:34:16,448 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2022-11-20 11:34:16,449 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2022-11-20 11:34:16,449 INFO L895 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse0 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0))) (or .cse2 .cse1) (or .cse2 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0))))) [2022-11-20 11:34:16,449 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2022-11-20 11:34:16,449 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2022-11-20 11:34:16,450 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse3 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0)) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse3 .cse0 .cse2) (or (not (<= (+ 2 |old(~ldv_count_2~0)|) ~ldv_count_1~0)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or .cse1 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0)))) [2022-11-20 11:34:16,450 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2022-11-20 11:34:16,450 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2022-11-20 11:34:16,450 INFO L902 garLoopResultBuilder]: At program point wait_for_completionENTRY(lines 2590 2592) the Hoare annotation is: true [2022-11-20 11:34:16,450 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2022-11-20 11:34:16,450 INFO L899 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2022-11-20 11:34:16,451 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2022-11-20 11:34:16,451 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 2545 2547) the Hoare annotation is: true [2022-11-20 11:34:16,451 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2022-11-20 11:34:16,451 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2022-11-20 11:34:16,451 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2412 2417) the Hoare annotation is: true [2022-11-20 11:34:16,452 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2022-11-20 11:34:16,452 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2022-11-20 11:34:16,452 INFO L895 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2022-11-20 11:34:16,452 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2022-11-20 11:34:16,452 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2022-11-20 11:34:16,453 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2022-11-20 11:34:16,453 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2022-11-20 11:34:16,453 INFO L895 garLoopResultBuilder]: At program point kmallocENTRY(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2022-11-20 11:34:16,454 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2022-11-20 11:34:16,454 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2022-11-20 11:34:16,454 INFO L902 garLoopResultBuilder]: At program point L1646-2(lines 1644 1647) the Hoare annotation is: true [2022-11-20 11:34:16,454 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2022-11-20 11:34:16,454 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2022-11-20 11:34:16,454 INFO L902 garLoopResultBuilder]: At program point L1567(lines 1564 1569) the Hoare annotation is: true [2022-11-20 11:34:16,455 INFO L902 garLoopResultBuilder]: At program point L1583(lines 1578 1585) the Hoare annotation is: true [2022-11-20 11:34:16,455 INFO L899 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2022-11-20 11:34:16,455 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2022-11-20 11:34:16,455 INFO L902 garLoopResultBuilder]: At program point L1575(lines 1570 1577) the Hoare annotation is: true [2022-11-20 11:34:16,455 INFO L902 garLoopResultBuilder]: At program point extract_valueENTRY(lines 1676 1683) the Hoare annotation is: true [2022-11-20 11:34:16,455 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2022-11-20 11:34:16,456 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2022-11-20 11:34:16,456 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-11-20 11:34:16,456 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2022-11-20 11:34:16,456 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2022-11-20 11:34:16,456 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2022-11-20 11:34:16,456 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2022-11-20 11:34:16,457 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2022-11-20 11:34:16,457 INFO L902 garLoopResultBuilder]: At program point L2226(lines 2201 2236) the Hoare annotation is: true [2022-11-20 11:34:16,457 INFO L902 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2022-11-20 11:34:16,457 INFO L902 garLoopResultBuilder]: At program point L2220(lines 2201 2236) the Hoare annotation is: true [2022-11-20 11:34:16,457 INFO L902 garLoopResultBuilder]: At program point L2218(lines 2201 2236) the Hoare annotation is: true [2022-11-20 11:34:16,457 INFO L902 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2022-11-20 11:34:16,458 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2022-11-20 11:34:16,458 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2022-11-20 11:34:16,458 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2022-11-20 11:34:16,458 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-11-20 11:34:16,458 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2022-11-20 11:34:16,458 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2022-11-20 11:34:16,458 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2022-11-20 11:34:16,459 INFO L902 garLoopResultBuilder]: At program point L2582(lines 2581 2583) the Hoare annotation is: true [2022-11-20 11:34:16,459 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2022-11-20 11:34:16,459 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2022-11-20 11:34:16,459 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2022-11-20 11:34:16,459 INFO L895 garLoopResultBuilder]: At program point ibmpex_bmc_deleteENTRY(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-11-20 11:34:16,459 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2022-11-20 11:34:16,460 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2022-11-20 11:34:16,460 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2022-11-20 11:34:16,460 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2022-11-20 11:34:16,460 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2022-11-20 11:34:16,460 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2022-11-20 11:34:16,460 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 2424 2429) the Hoare annotation is: true [2022-11-20 11:34:16,460 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2022-11-20 11:34:16,461 INFO L902 garLoopResultBuilder]: At program point ipmi_free_recv_msgENTRY(lines 2556 2558) the Hoare annotation is: true [2022-11-20 11:34:16,461 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2022-11-20 11:34:16,461 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2022-11-20 11:34:16,461 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2022-11-20 11:34:16,462 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2022-11-20 11:34:16,462 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2022-11-20 11:34:16,462 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2022-11-20 11:34:16,462 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2022-11-20 11:34:16,462 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2022-11-20 11:34:16,462 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-11-20 11:34:16,463 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2022-11-20 11:34:16,463 INFO L902 garLoopResultBuilder]: At program point L2561(lines 2560 2562) the Hoare annotation is: true [2022-11-20 11:34:16,463 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2022-11-20 11:34:16,463 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2022-11-20 11:34:16,463 INFO L895 garLoopResultBuilder]: At program point L2573(lines 2572 2574) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2022-11-20 11:34:16,463 INFO L902 garLoopResultBuilder]: At program point L1708(lines 1698 1718) the Hoare annotation is: true [2022-11-20 11:34:16,464 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2022-11-20 11:34:16,464 INFO L895 garLoopResultBuilder]: At program point ibmpex_send_messageENTRY(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2022-11-20 11:34:16,464 INFO L895 garLoopResultBuilder]: At program point L1701(lines 1698 1718) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2022-11-20 11:34:16,464 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2022-11-20 11:34:16,465 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2022-11-20 11:34:16,465 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 2539 2541) the Hoare annotation is: true [2022-11-20 11:34:16,465 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2022-11-20 11:34:16,465 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2022-11-20 11:34:16,465 INFO L895 garLoopResultBuilder]: At program point L2249-1(lines 2238 2252) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,466 INFO L895 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,466 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2022-11-20 11:34:16,466 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2022-11-20 11:34:16,466 INFO L895 garLoopResultBuilder]: At program point L2514(lines 2513 2515) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,466 INFO L902 garLoopResultBuilder]: At program point L2316(lines 2302 2320) the Hoare annotation is: true [2022-11-20 11:34:16,466 INFO L899 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2022-11-20 11:34:16,467 INFO L895 garLoopResultBuilder]: At program point L2184(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,467 INFO L895 garLoopResultBuilder]: At program point L2118(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2022-11-20 11:34:16,467 INFO L895 garLoopResultBuilder]: At program point L2085(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,467 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2022-11-20 11:34:16,467 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2022-11-20 11:34:16,468 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2022-11-20 11:34:16,468 INFO L895 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,468 INFO L895 garLoopResultBuilder]: At program point L2284(lines 2254 2286) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,468 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2022-11-20 11:34:16,468 INFO L895 garLoopResultBuilder]: At program point L2384(lines 2379 2386) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,469 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2022-11-20 11:34:16,469 INFO L895 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,469 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2022-11-20 11:34:16,469 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2022-11-20 11:34:16,469 INFO L895 garLoopResultBuilder]: At program point L2550(lines 2549 2551) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,470 INFO L895 garLoopResultBuilder]: At program point L2517(lines 2516 2518) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,470 INFO L902 garLoopResultBuilder]: At program point L2319(lines 2295 2321) the Hoare annotation is: true [2022-11-20 11:34:16,470 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2022-11-20 11:34:16,470 INFO L895 garLoopResultBuilder]: At program point L2122(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,470 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2022-11-20 11:34:16,470 INFO L895 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,471 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2022-11-20 11:34:16,471 INFO L895 garLoopResultBuilder]: At program point L1594(lines 1590 1596) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,471 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2022-11-20 11:34:16,471 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2022-11-20 11:34:16,471 INFO L895 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,471 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2022-11-20 11:34:16,472 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2022-11-20 11:34:16,472 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2022-11-20 11:34:16,472 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2022-11-20 11:34:16,472 INFO L895 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,472 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2022-11-20 11:34:16,472 INFO L895 garLoopResultBuilder]: At program point L2520(lines 2519 2521) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,473 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2022-11-20 11:34:16,473 INFO L895 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,473 INFO L895 garLoopResultBuilder]: At program point L2190(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,473 INFO L895 garLoopResultBuilder]: At program point L2124(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,473 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2022-11-20 11:34:16,474 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2022-11-20 11:34:16,474 INFO L895 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,474 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2022-11-20 11:34:16,474 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2022-11-20 11:34:16,474 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2022-11-20 11:34:16,474 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2022-11-20 11:34:16,475 INFO L895 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,475 INFO L895 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,475 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2022-11-20 11:34:16,475 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2022-11-20 11:34:16,475 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2022-11-20 11:34:16,476 INFO L895 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,476 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2022-11-20 11:34:16,476 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2022-11-20 11:34:16,476 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2022-11-20 11:34:16,476 INFO L895 garLoopResultBuilder]: At program point L2292(lines 2287 2294) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2022-11-20 11:34:16,476 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2022-11-20 11:34:16,476 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2022-11-20 11:34:16,477 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2022-11-20 11:34:16,477 INFO L895 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,477 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2022-11-20 11:34:16,477 INFO L895 garLoopResultBuilder]: At program point L1929(lines 1916 1931) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,477 INFO L895 garLoopResultBuilder]: At program point L1863(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,478 INFO L895 garLoopResultBuilder]: At program point L2392(lines 2387 2394) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2022-11-20 11:34:16,478 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2022-11-20 11:34:16,478 INFO L895 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,478 INFO L895 garLoopResultBuilder]: At program point L2194(lines 2131 2196) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,478 INFO L895 garLoopResultBuilder]: At program point L2128(lines 2012 2130) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,479 INFO L895 garLoopResultBuilder]: At program point L2095(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,479 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2022-11-20 11:34:16,479 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2022-11-20 11:34:16,479 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2022-11-20 11:34:16,479 INFO L895 garLoopResultBuilder]: At program point L1865(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,480 INFO L895 garLoopResultBuilder]: At program point L1767(lines 1755 1769) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,480 INFO L895 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,480 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2022-11-20 11:34:16,480 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2022-11-20 11:34:16,480 INFO L895 garLoopResultBuilder]: At program point L2527(lines 2526 2528) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,480 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2022-11-20 11:34:16,481 INFO L895 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,481 INFO L895 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,481 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2022-11-20 11:34:16,481 INFO L895 garLoopResultBuilder]: At program point L1868(lines 1842 1870) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,481 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2022-11-20 11:34:16,482 INFO L895 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,482 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2022-11-20 11:34:16,482 INFO L895 garLoopResultBuilder]: At program point L1968(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2022-11-20 11:34:16,482 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:34:16,482 INFO L895 garLoopResultBuilder]: At program point L2365(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,483 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2022-11-20 11:34:16,483 INFO L895 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,483 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2022-11-20 11:34:16,483 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2022-11-20 11:34:16,483 INFO L895 garLoopResultBuilder]: At program point L1738(lines 1720 1740) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,484 INFO L895 garLoopResultBuilder]: At program point L2498(lines 2486 2500) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2022-11-20 11:34:16,484 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2022-11-20 11:34:16,484 INFO L895 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,484 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2022-11-20 11:34:16,484 INFO L895 garLoopResultBuilder]: At program point L1970(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2022-11-20 11:34:16,485 INFO L895 garLoopResultBuilder]: At program point L2565(lines 2564 2566) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2022-11-20 11:34:16,485 INFO L895 garLoopResultBuilder]: At program point L2466(lines 2462 2468) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)))) [2022-11-20 11:34:16,485 INFO L895 garLoopResultBuilder]: At program point L2400(lines 2395 2402) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,485 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2022-11-20 11:34:16,485 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2022-11-20 11:34:16,485 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2022-11-20 11:34:16,486 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2022-11-20 11:34:16,486 INFO L895 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2022-11-20 11:34:16,486 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2022-11-20 11:34:16,486 INFO L895 garLoopResultBuilder]: At program point L1609(lines 1603 1611) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,486 INFO L895 garLoopResultBuilder]: At program point L2369(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,487 INFO L895 garLoopResultBuilder]: At program point L1973(lines 1948 1975) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2022-11-20 11:34:16,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:34:16,487 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2022-11-20 11:34:16,487 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2022-11-20 11:34:16,487 INFO L895 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,487 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2022-11-20 11:34:16,488 INFO L902 garLoopResultBuilder]: At program point L2569(lines 2568 2570) the Hoare annotation is: true [2022-11-20 11:34:16,488 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2022-11-20 11:34:16,488 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2022-11-20 11:34:16,488 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2022-11-20 11:34:16,488 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2022-11-20 11:34:16,488 INFO L895 garLoopResultBuilder]: At program point L2009(lines 1976 2011) the Hoare annotation is: (let ((.cse4 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse5 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (<= (+ |ULTIMATE.start_create_sensor_#res#1| 12) 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) .cse3) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse5 .cse1 (= ~ldv_count_2~0 0) .cse2))) [2022-11-20 11:34:16,489 INFO L895 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2022-11-20 11:34:16,489 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2022-11-20 11:34:16,489 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2022-11-20 11:34:16,489 INFO L895 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:34:16,490 INFO L895 garLoopResultBuilder]: At program point L2076(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) .cse0 .cse2 (= ~ldv_count_2~0 0)) (and .cse3 .cse1) (and .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2022-11-20 11:34:16,490 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2022-11-20 11:34:16,490 INFO L895 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,490 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2022-11-20 11:34:16,490 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2022-11-20 11:34:16,490 INFO L902 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2022-11-20 11:34:16,491 INFO L895 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,491 INFO L895 garLoopResultBuilder]: At program point L1945(lines 1932 1947) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (= |ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1#1| 0)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)))) [2022-11-20 11:34:16,491 INFO L895 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,491 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2022-11-20 11:34:16,491 INFO L895 garLoopResultBuilder]: At program point L2408(lines 2403 2410) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,492 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2022-11-20 11:34:16,492 INFO L895 garLoopResultBuilder]: At program point L2078(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2022-11-20 11:34:16,492 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2022-11-20 11:34:16,492 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2022-11-20 11:34:16,492 INFO L902 garLoopResultBuilder]: At program point L2376(lines 2327 2378) the Hoare annotation is: true [2022-11-20 11:34:16,492 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2022-11-20 11:34:16,493 INFO L895 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,493 INFO L895 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2022-11-20 11:34:16,493 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2022-11-20 11:34:16,493 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2022-11-20 11:34:16,493 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2022-11-20 11:34:16,493 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2022-11-20 11:34:16,494 INFO L895 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2022-11-20 11:34:16,494 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:34:16,494 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,494 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,494 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-11-20 11:34:16,495 INFO L902 garLoopResultBuilder]: At program point L2576(lines 2575 2577) the Hoare annotation is: true [2022-11-20 11:34:16,495 INFO L895 garLoopResultBuilder]: At program point L2510(lines 2501 2512) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2022-11-20 11:34:16,495 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-11-20 11:34:16,495 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,495 INFO L895 garLoopResultBuilder]: At program point L2543-2(lines 2542 2544) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,496 INFO L895 garLoopResultBuilder]: At program point L2114(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2022-11-20 11:34:16,496 INFO L895 garLoopResultBuilder]: At program point L2081(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,496 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2022-11-20 11:34:16,496 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2022-11-20 11:34:16,496 INFO L895 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2022-11-20 11:34:16,497 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2022-11-20 11:34:16,497 INFO L895 garLoopResultBuilder]: At program point L1752(lines 1741 1754) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,497 INFO L902 garLoopResultBuilder]: At program point L2314(lines 2302 2320) the Hoare annotation is: true [2022-11-20 11:34:16,497 INFO L895 garLoopResultBuilder]: At program point L2116(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,497 INFO L895 garLoopResultBuilder]: At program point L2083(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2022-11-20 11:34:16,498 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2022-11-20 11:34:16,498 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2022-11-20 11:34:16,498 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 2536 2538) the Hoare annotation is: true [2022-11-20 11:34:16,501 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:16,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:34:16,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,544 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,545 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,546 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,547 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,548 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,549 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:34:16 BoogieIcfgContainer [2022-11-20 11:34:16,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:34:16,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:34:16,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:34:16,554 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:34:16,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:30:25" (3/4) ... [2022-11-20 11:34:16,558 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:34:16,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-20 11:34:16,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2022-11-20 11:34:16,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-20 11:34:16,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2022-11-20 11:34:16,565 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-20 11:34:16,566 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-11-20 11:34:16,567 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-20 11:34:16,567 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2022-11-20 11:34:16,567 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2022-11-20 11:34:16,567 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-20 11:34:16,585 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2022-11-20 11:34:16,586 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2022-11-20 11:34:16,588 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-20 11:34:16,589 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 11:34:16,591 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 11:34:16,592 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:34:16,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) [2022-11-20 11:34:16,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2022-11-20 11:34:16,628 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2022-11-20 11:34:16,745 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:34:16,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:34:16,746 INFO L158 Benchmark]: Toolchain (without parser) took 234426.38ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 122.3MB in the beginning and 699.2MB in the end (delta: -576.9MB). Peak memory consumption was 341.9MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,747 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:34:16,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 988.09ms. Allocated memory is still 169.9MB. Free memory was 122.3MB in the beginning and 73.3MB in the end (delta: 49.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.95ms. Allocated memory is still 169.9MB. Free memory was 73.3MB in the beginning and 65.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,748 INFO L158 Benchmark]: Boogie Preprocessor took 82.72ms. Allocated memory is still 169.9MB. Free memory was 65.7MB in the beginning and 58.6MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,749 INFO L158 Benchmark]: RCFGBuilder took 1798.25ms. Allocated memory is still 169.9MB. Free memory was 58.6MB in the beginning and 117.4MB in the end (delta: -58.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,749 INFO L158 Benchmark]: TraceAbstraction took 231254.32ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 116.3MB in the beginning and 716.8MB in the end (delta: -600.5MB). Peak memory consumption was 668.3MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,750 INFO L158 Benchmark]: Witness Printer took 191.64ms. Allocated memory is still 1.1GB. Free memory was 716.8MB in the beginning and 699.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 11:34:16,757 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.33ms. Allocated memory is still 134.2MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 988.09ms. Allocated memory is still 169.9MB. Free memory was 122.3MB in the beginning and 73.3MB in the end (delta: 49.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.95ms. Allocated memory is still 169.9MB. Free memory was 73.3MB in the beginning and 65.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.72ms. Allocated memory is still 169.9MB. Free memory was 65.7MB in the beginning and 58.6MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1798.25ms. Allocated memory is still 169.9MB. Free memory was 58.6MB in the beginning and 117.4MB in the end (delta: -58.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 231254.32ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 116.3MB in the beginning and 716.8MB in the end (delta: -600.5MB). Peak memory consumption was 668.3MB. Max. memory is 16.1GB. * Witness Printer took 191.64ms. Allocated memory is still 1.1GB. Free memory was 716.8MB in the beginning and 699.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. 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: 231.1s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 195.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8514 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7894 mSDsluCounter, 19756 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13444 mSDsCounter, 2658 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9940 IncrementalHoareTripleChecker+Invalid, 12598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2658 mSolverCounterUnsat, 6312 mSDtfsCounter, 9940 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1133 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=11, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 9153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3879 PreInvPairs, 4613 NumberOfFragments, 4151 HoareAnnotationTreeSize, 3879 FomulaSimplifications, 489212 FormulaSimplificationTreeSizeReduction, 162.2s HoareSimplificationTime, 134 FomulaSimplificationsInter, 2854068 FormulaSimplificationTreeSizeReductionInter, 33.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2976 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3404 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 1546/1550 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_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1644]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2549]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2572]: Loop Invariant [2022-11-20 11:34:16,782 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,782 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,787 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,787 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,787 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,787 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(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: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2513]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1948]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && tmp___1 == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2560]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2519]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2526]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2501]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2516]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1755]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2012]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1916]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - 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: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2254]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2462]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0) - 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: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant [2022-11-20 11:34:16,804 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,804 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,804 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,804 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,808 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,808 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,808 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,808 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,808 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:34:16,810 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:34:16,810 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - 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: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2387]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - 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: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2486]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 2581]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 11:34:16,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fabe3878-33dc-4553-b57e-d19abc21f4b9/bin/uautomizer-ug76WZFUDN/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