./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5e6e7e53815507f396bd444a358cf3b9610d5992 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:26:10,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:26:10,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:26:10,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:26:10,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:26:10,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:26:10,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:26:10,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:26:10,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:26:10,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:26:10,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:26:10,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:26:10,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:26:10,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:26:10,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:26:10,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:26:10,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:26:10,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:26:10,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:26:10,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:26:10,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:26:10,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:26:10,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:26:10,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:26:10,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:26:10,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:26:10,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:26:10,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:26:10,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:26:10,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:26:10,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:26:10,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:26:10,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:26:10,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:26:10,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:26:10,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:26:10,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:26:10,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:26:10,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:26:10,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:26:10,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:26:10,818 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-15 21:26:10,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:26:10,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:26:10,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:26:10,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:26:10,844 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:26:10,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:26:10,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:26:10,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:26:10,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:26:10,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:26:10,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:26:10,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:26:10,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:26:10,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:26:10,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:26:10,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:26:10,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:26:10,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:26:10,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:26:10,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:26:10,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:26:10,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:26:10,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:26:10,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:26:10,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:26:10,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:26:10,854 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer 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(__VERIFIER_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 -> 5e6e7e53815507f396bd444a358cf3b9610d5992 [2019-11-15 21:26:10,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:26:10,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:26:10,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:26:10,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:26:10,917 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:26:10,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-11-15 21:26:10,983 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/data/3dba776b1/c5cf4677072b4f58ad1f441812d9f667/FLAG509b2abfe [2019-11-15 21:26:11,560 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:26:11,560 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-11-15 21:26:11,580 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/data/3dba776b1/c5cf4677072b4f58ad1f441812d9f667/FLAG509b2abfe [2019-11-15 21:26:11,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/data/3dba776b1/c5cf4677072b4f58ad1f441812d9f667 [2019-11-15 21:26:11,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:26:11,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:26:11,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:26:11,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:26:11,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:26:11,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:26:11" (1/1) ... [2019-11-15 21:26:11,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c642ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:11, skipping insertion in model container [2019-11-15 21:26:11,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:26:11" (1/1) ... [2019-11-15 21:26:11,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:26:11,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:26:12,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:26:12,640 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:26:12,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:26:12,904 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:26:12,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12 WrapperNode [2019-11-15 21:26:12,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:26:12,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:26:12,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:26:12,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:26:12,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:12,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:26:13,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:26:13,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:26:13,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:26:13,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... [2019-11-15 21:26:13,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:26:13,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:26:13,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:26:13,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:26:13,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:26:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 21:26:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 21:26:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 21:26:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:26:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:26:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:26:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:26:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:26:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-15 21:26:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:26:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:26:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:26:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 21:26:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 21:26:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:26:13,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:26:15,148 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:26:15,148 INFO L284 CfgBuilder]: Removed 222 assume(true) statements. [2019-11-15 21:26:15,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:15 BoogieIcfgContainer [2019-11-15 21:26:15,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:26:15,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:26:15,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:26:15,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:26:15,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:26:11" (1/3) ... [2019-11-15 21:26:15,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3150e968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:26:15, skipping insertion in model container [2019-11-15 21:26:15,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:12" (2/3) ... [2019-11-15 21:26:15,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3150e968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:26:15, skipping insertion in model container [2019-11-15 21:26:15,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:15" (3/3) ... [2019-11-15 21:26:15,158 INFO L109 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-11-15 21:26:15,167 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:26:15,177 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:26:15,188 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:26:15,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:26:15,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:26:15,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:26:15,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:26:15,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:26:15,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:26:15,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:26:15,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:26:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states. [2019-11-15 21:26:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:26:15,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:15,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:15,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1549084668, now seen corresponding path program 1 times [2019-11-15 21:26:15,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:15,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130073628] [2019-11-15 21:26:15,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:15,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:15,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:15,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130073628] [2019-11-15 21:26:15,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:15,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:15,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856694328] [2019-11-15 21:26:15,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:15,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:15,755 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 4 states. [2019-11-15 21:26:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:15,933 INFO L93 Difference]: Finished difference Result 580 states and 761 transitions. [2019-11-15 21:26:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:15,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:26:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:15,963 INFO L225 Difference]: With dead ends: 580 [2019-11-15 21:26:15,964 INFO L226 Difference]: Without dead ends: 294 [2019-11-15 21:26:15,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-15 21:26:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 194. [2019-11-15 21:26:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-15 21:26:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 256 transitions. [2019-11-15 21:26:16,037 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 256 transitions. Word has length 59 [2019-11-15 21:26:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:16,037 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 256 transitions. [2019-11-15 21:26:16,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 256 transitions. [2019-11-15 21:26:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:26:16,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:16,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:16,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -967525942, now seen corresponding path program 1 times [2019-11-15 21:26:16,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:16,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625151694] [2019-11-15 21:26:16,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:16,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625151694] [2019-11-15 21:26:16,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:16,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:16,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721804030] [2019-11-15 21:26:16,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:16,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:16,363 INFO L87 Difference]: Start difference. First operand 194 states and 256 transitions. Second operand 4 states. [2019-11-15 21:26:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:16,454 INFO L93 Difference]: Finished difference Result 471 states and 621 transitions. [2019-11-15 21:26:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:16,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 21:26:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:16,457 INFO L225 Difference]: With dead ends: 471 [2019-11-15 21:26:16,457 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 21:26:16,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 21:26:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 196. [2019-11-15 21:26:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-15 21:26:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 258 transitions. [2019-11-15 21:26:16,480 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 258 transitions. Word has length 63 [2019-11-15 21:26:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:16,482 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 258 transitions. [2019-11-15 21:26:16,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 258 transitions. [2019-11-15 21:26:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:26:16,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:16,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:16,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1978643192, now seen corresponding path program 1 times [2019-11-15 21:26:16,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:16,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534586888] [2019-11-15 21:26:16,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:16,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534586888] [2019-11-15 21:26:16,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:16,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:16,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202572306] [2019-11-15 21:26:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:16,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:16,666 INFO L87 Difference]: Start difference. First operand 196 states and 258 transitions. Second operand 3 states. [2019-11-15 21:26:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:16,686 INFO L93 Difference]: Finished difference Result 387 states and 512 transitions. [2019-11-15 21:26:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:16,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 21:26:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:16,689 INFO L225 Difference]: With dead ends: 387 [2019-11-15 21:26:16,689 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 21:26:16,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 21:26:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-15 21:26:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 21:26:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 259 transitions. [2019-11-15 21:26:16,716 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 259 transitions. Word has length 63 [2019-11-15 21:26:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:16,721 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 259 transitions. [2019-11-15 21:26:16,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2019-11-15 21:26:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:26:16,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:16,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:16,725 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1036460426, now seen corresponding path program 1 times [2019-11-15 21:26:16,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:16,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713981966] [2019-11-15 21:26:16,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:17,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713981966] [2019-11-15 21:26:17,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:17,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:26:17,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310360426] [2019-11-15 21:26:17,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:26:17,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:26:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:17,006 INFO L87 Difference]: Start difference. First operand 197 states and 259 transitions. Second operand 7 states. [2019-11-15 21:26:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:17,360 INFO L93 Difference]: Finished difference Result 828 states and 1105 transitions. [2019-11-15 21:26:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:26:17,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-15 21:26:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:17,365 INFO L225 Difference]: With dead ends: 828 [2019-11-15 21:26:17,365 INFO L226 Difference]: Without dead ends: 637 [2019-11-15 21:26:17,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:26:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-11-15 21:26:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 202. [2019-11-15 21:26:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-15 21:26:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 264 transitions. [2019-11-15 21:26:17,377 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 264 transitions. Word has length 63 [2019-11-15 21:26:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:17,377 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 264 transitions. [2019-11-15 21:26:17,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:26:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 264 transitions. [2019-11-15 21:26:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:26:17,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:17,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:17,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 903798714, now seen corresponding path program 1 times [2019-11-15 21:26:17,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:17,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994135694] [2019-11-15 21:26:17,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:17,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:17,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:17,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994135694] [2019-11-15 21:26:17,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:17,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:26:17,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898486275] [2019-11-15 21:26:17,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:26:17,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:26:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:17,616 INFO L87 Difference]: Start difference. First operand 202 states and 264 transitions. Second operand 7 states. [2019-11-15 21:26:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:17,834 INFO L93 Difference]: Finished difference Result 581 states and 767 transitions. [2019-11-15 21:26:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:26:17,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-15 21:26:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:17,837 INFO L225 Difference]: With dead ends: 581 [2019-11-15 21:26:17,837 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 21:26:17,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:26:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 21:26:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 207. [2019-11-15 21:26:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 21:26:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 269 transitions. [2019-11-15 21:26:17,847 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 269 transitions. Word has length 64 [2019-11-15 21:26:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:17,847 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 269 transitions. [2019-11-15 21:26:17,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:26:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 269 transitions. [2019-11-15 21:26:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:26:17,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:17,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:17,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -67843420, now seen corresponding path program 1 times [2019-11-15 21:26:17,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:17,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551765984] [2019-11-15 21:26:17,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:17,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:17,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:18,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551765984] [2019-11-15 21:26:18,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:18,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:18,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429502341] [2019-11-15 21:26:18,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:18,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:18,060 INFO L87 Difference]: Start difference. First operand 207 states and 269 transitions. Second operand 5 states. [2019-11-15 21:26:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:18,241 INFO L93 Difference]: Finished difference Result 600 states and 786 transitions. [2019-11-15 21:26:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:18,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:26:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:18,245 INFO L225 Difference]: With dead ends: 600 [2019-11-15 21:26:18,245 INFO L226 Difference]: Without dead ends: 594 [2019-11-15 21:26:18,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-15 21:26:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 402. [2019-11-15 21:26:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-15 21:26:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 526 transitions. [2019-11-15 21:26:18,262 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 526 transitions. Word has length 65 [2019-11-15 21:26:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:18,263 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 526 transitions. [2019-11-15 21:26:18,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 526 transitions. [2019-11-15 21:26:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:26:18,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:18,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:18,265 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash 124897524, now seen corresponding path program 1 times [2019-11-15 21:26:18,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:18,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450918459] [2019-11-15 21:26:18,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:18,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450918459] [2019-11-15 21:26:18,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:18,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:18,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62969790] [2019-11-15 21:26:18,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:18,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:18,361 INFO L87 Difference]: Start difference. First operand 402 states and 526 transitions. Second operand 3 states. [2019-11-15 21:26:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:18,451 INFO L93 Difference]: Finished difference Result 798 states and 1046 transitions. [2019-11-15 21:26:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:18,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 21:26:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:18,455 INFO L225 Difference]: With dead ends: 798 [2019-11-15 21:26:18,455 INFO L226 Difference]: Without dead ends: 597 [2019-11-15 21:26:18,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-15 21:26:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-11-15 21:26:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-15 21:26:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 780 transitions. [2019-11-15 21:26:18,479 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 780 transitions. Word has length 71 [2019-11-15 21:26:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:18,480 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 780 transitions. [2019-11-15 21:26:18,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 780 transitions. [2019-11-15 21:26:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:26:18,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:18,486 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:18,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1127714545, now seen corresponding path program 1 times [2019-11-15 21:26:18,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:18,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729855592] [2019-11-15 21:26:18,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:26:18,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729855592] [2019-11-15 21:26:18,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:18,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:18,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381562045] [2019-11-15 21:26:18,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:18,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:18,621 INFO L87 Difference]: Start difference. First operand 595 states and 780 transitions. Second operand 4 states. [2019-11-15 21:26:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:18,748 INFO L93 Difference]: Finished difference Result 1697 states and 2205 transitions. [2019-11-15 21:26:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:18,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 21:26:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:18,755 INFO L225 Difference]: With dead ends: 1697 [2019-11-15 21:26:18,756 INFO L226 Difference]: Without dead ends: 1108 [2019-11-15 21:26:18,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-11-15 21:26:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 601. [2019-11-15 21:26:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-11-15 21:26:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 786 transitions. [2019-11-15 21:26:18,791 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 786 transitions. Word has length 103 [2019-11-15 21:26:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:18,792 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 786 transitions. [2019-11-15 21:26:18,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 786 transitions. [2019-11-15 21:26:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:26:18,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:18,794 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:18,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 923269453, now seen corresponding path program 1 times [2019-11-15 21:26:18,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:18,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921067485] [2019-11-15 21:26:18,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:26:18,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921067485] [2019-11-15 21:26:18,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:18,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:18,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514669558] [2019-11-15 21:26:18,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:18,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:18,992 INFO L87 Difference]: Start difference. First operand 601 states and 786 transitions. Second operand 3 states. [2019-11-15 21:26:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:19,034 INFO L93 Difference]: Finished difference Result 1199 states and 1572 transitions. [2019-11-15 21:26:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:19,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 21:26:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:19,038 INFO L225 Difference]: With dead ends: 1199 [2019-11-15 21:26:19,038 INFO L226 Difference]: Without dead ends: 604 [2019-11-15 21:26:19,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-11-15 21:26:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-11-15 21:26:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-15 21:26:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 789 transitions. [2019-11-15 21:26:19,066 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 789 transitions. Word has length 103 [2019-11-15 21:26:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:19,066 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 789 transitions. [2019-11-15 21:26:19,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 789 transitions. [2019-11-15 21:26:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:26:19,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:19,068 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:19,069 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 79263951, now seen corresponding path program 1 times [2019-11-15 21:26:19,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:19,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878134931] [2019-11-15 21:26:19,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:26:19,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878134931] [2019-11-15 21:26:19,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:19,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:19,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512024847] [2019-11-15 21:26:19,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:19,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:19,195 INFO L87 Difference]: Start difference. First operand 604 states and 789 transitions. Second operand 4 states. [2019-11-15 21:26:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:19,312 INFO L93 Difference]: Finished difference Result 2679 states and 3474 transitions. [2019-11-15 21:26:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:19,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 21:26:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:19,324 INFO L225 Difference]: With dead ends: 2679 [2019-11-15 21:26:19,324 INFO L226 Difference]: Without dead ends: 2081 [2019-11-15 21:26:19,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2019-11-15 21:26:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 610. [2019-11-15 21:26:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-15 21:26:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 795 transitions. [2019-11-15 21:26:19,368 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 795 transitions. Word has length 103 [2019-11-15 21:26:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:19,369 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 795 transitions. [2019-11-15 21:26:19,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 795 transitions. [2019-11-15 21:26:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:26:19,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:19,371 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:19,371 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1850764468, now seen corresponding path program 1 times [2019-11-15 21:26:19,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:19,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985196628] [2019-11-15 21:26:19,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:26:19,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985196628] [2019-11-15 21:26:19,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:19,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:19,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359344778] [2019-11-15 21:26:19,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:19,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:19,497 INFO L87 Difference]: Start difference. First operand 610 states and 795 transitions. Second operand 4 states. [2019-11-15 21:26:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:19,649 INFO L93 Difference]: Finished difference Result 2846 states and 3711 transitions. [2019-11-15 21:26:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:19,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 21:26:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:19,662 INFO L225 Difference]: With dead ends: 2846 [2019-11-15 21:26:19,662 INFO L226 Difference]: Without dead ends: 2242 [2019-11-15 21:26:19,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-11-15 21:26:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 616. [2019-11-15 21:26:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-11-15 21:26:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 801 transitions. [2019-11-15 21:26:19,716 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 801 transitions. Word has length 104 [2019-11-15 21:26:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:19,716 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 801 transitions. [2019-11-15 21:26:19,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2019-11-15 21:26:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:26:19,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:19,718 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:19,719 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash 431077116, now seen corresponding path program 1 times [2019-11-15 21:26:19,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:19,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280223727] [2019-11-15 21:26:19,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:19,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:19,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280223727] [2019-11-15 21:26:19,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:19,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:19,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31044627] [2019-11-15 21:26:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:19,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:19,851 INFO L87 Difference]: Start difference. First operand 616 states and 801 transitions. Second operand 4 states. [2019-11-15 21:26:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:20,046 INFO L93 Difference]: Finished difference Result 2781 states and 3612 transitions. [2019-11-15 21:26:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:20,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 21:26:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:20,058 INFO L225 Difference]: With dead ends: 2781 [2019-11-15 21:26:20,059 INFO L226 Difference]: Without dead ends: 2171 [2019-11-15 21:26:20,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2019-11-15 21:26:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 682. [2019-11-15 21:26:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-11-15 21:26:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 887 transitions. [2019-11-15 21:26:20,122 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 887 transitions. Word has length 104 [2019-11-15 21:26:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:20,123 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 887 transitions. [2019-11-15 21:26:20,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 887 transitions. [2019-11-15 21:26:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:26:20,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:20,125 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:20,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash -98837862, now seen corresponding path program 1 times [2019-11-15 21:26:20,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:20,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39996132] [2019-11-15 21:26:20,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:20,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:20,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:20,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39996132] [2019-11-15 21:26:20,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:20,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:26:20,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717029075] [2019-11-15 21:26:20,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:26:20,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:26:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:26:20,357 INFO L87 Difference]: Start difference. First operand 682 states and 887 transitions. Second operand 6 states. [2019-11-15 21:26:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:20,865 INFO L93 Difference]: Finished difference Result 2451 states and 3205 transitions. [2019-11-15 21:26:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:26:20,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-15 21:26:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:20,875 INFO L225 Difference]: With dead ends: 2451 [2019-11-15 21:26:20,875 INFO L226 Difference]: Without dead ends: 1775 [2019-11-15 21:26:20,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:26:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-11-15 21:26:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 706. [2019-11-15 21:26:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-15 21:26:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 911 transitions. [2019-11-15 21:26:20,951 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 911 transitions. Word has length 105 [2019-11-15 21:26:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:20,952 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 911 transitions. [2019-11-15 21:26:20,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:26:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 911 transitions. [2019-11-15 21:26:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 21:26:20,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:20,954 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:20,954 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2138009594, now seen corresponding path program 1 times [2019-11-15 21:26:20,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:20,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688766413] [2019-11-15 21:26:20,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:20,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:21,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688766413] [2019-11-15 21:26:21,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708472217] [2019-11-15 21:26:21,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:21,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:26:21,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:26:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:21,792 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:26:21,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 21:26:21,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113006615] [2019-11-15 21:26:21,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:21,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:21,794 INFO L87 Difference]: Start difference. First operand 706 states and 911 transitions. Second operand 5 states. [2019-11-15 21:26:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:22,035 INFO L93 Difference]: Finished difference Result 2340 states and 3008 transitions. [2019-11-15 21:26:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:22,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-15 21:26:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:22,045 INFO L225 Difference]: With dead ends: 2340 [2019-11-15 21:26:22,045 INFO L226 Difference]: Without dead ends: 1640 [2019-11-15 21:26:22,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-11-15 21:26:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 883. [2019-11-15 21:26:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-15 21:26:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1131 transitions. [2019-11-15 21:26:22,147 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1131 transitions. Word has length 106 [2019-11-15 21:26:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:22,147 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1131 transitions. [2019-11-15 21:26:22,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1131 transitions. [2019-11-15 21:26:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 21:26:22,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:22,150 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:22,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:22,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1204149741, now seen corresponding path program 1 times [2019-11-15 21:26:22,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:22,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192790231] [2019-11-15 21:26:22,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:22,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:22,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:22,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192790231] [2019-11-15 21:26:22,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:22,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:22,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973436285] [2019-11-15 21:26:22,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:22,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:22,526 INFO L87 Difference]: Start difference. First operand 883 states and 1131 transitions. Second operand 5 states. [2019-11-15 21:26:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:23,112 INFO L93 Difference]: Finished difference Result 4455 states and 5690 transitions. [2019-11-15 21:26:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:26:23,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-11-15 21:26:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:23,124 INFO L225 Difference]: With dead ends: 4455 [2019-11-15 21:26:23,124 INFO L226 Difference]: Without dead ends: 2132 [2019-11-15 21:26:23,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:26:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-15 21:26:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 823. [2019-11-15 21:26:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-15 21:26:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1036 transitions. [2019-11-15 21:26:23,225 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1036 transitions. Word has length 113 [2019-11-15 21:26:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:23,226 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1036 transitions. [2019-11-15 21:26:23,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1036 transitions. [2019-11-15 21:26:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 21:26:23,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:23,228 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:23,228 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1369132351, now seen corresponding path program 1 times [2019-11-15 21:26:23,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:23,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652382209] [2019-11-15 21:26:23,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:23,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:23,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:26:23,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652382209] [2019-11-15 21:26:23,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:23,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:23,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536777414] [2019-11-15 21:26:23,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:23,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:23,364 INFO L87 Difference]: Start difference. First operand 823 states and 1036 transitions. Second operand 4 states. [2019-11-15 21:26:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:23,620 INFO L93 Difference]: Finished difference Result 2493 states and 3150 transitions. [2019-11-15 21:26:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:23,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 21:26:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:23,630 INFO L225 Difference]: With dead ends: 2493 [2019-11-15 21:26:23,631 INFO L226 Difference]: Without dead ends: 1676 [2019-11-15 21:26:23,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-11-15 21:26:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 729. [2019-11-15 21:26:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-15 21:26:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 920 transitions. [2019-11-15 21:26:23,727 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 920 transitions. Word has length 115 [2019-11-15 21:26:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:23,728 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 920 transitions. [2019-11-15 21:26:23,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 920 transitions. [2019-11-15 21:26:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 21:26:23,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:23,730 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:26:23,731 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1210358878, now seen corresponding path program 1 times [2019-11-15 21:26:23,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:23,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884472183] [2019-11-15 21:26:23,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:23,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:23,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:23,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884472183] [2019-11-15 21:26:23,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:23,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:23,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658176612] [2019-11-15 21:26:23,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:23,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:23,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:23,899 INFO L87 Difference]: Start difference. First operand 729 states and 920 transitions. Second operand 4 states. [2019-11-15 21:26:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:24,083 INFO L93 Difference]: Finished difference Result 986 states and 1245 transitions. [2019-11-15 21:26:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:24,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-15 21:26:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:24,087 INFO L225 Difference]: With dead ends: 986 [2019-11-15 21:26:24,087 INFO L226 Difference]: Without dead ends: 472 [2019-11-15 21:26:24,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-15 21:26:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 432. [2019-11-15 21:26:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-15 21:26:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 545 transitions. [2019-11-15 21:26:24,140 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 545 transitions. Word has length 124 [2019-11-15 21:26:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:24,140 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 545 transitions. [2019-11-15 21:26:24,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 545 transitions. [2019-11-15 21:26:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-15 21:26:24,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:24,143 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:26:24,144 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1549883475, now seen corresponding path program 1 times [2019-11-15 21:26:24,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:24,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023528061] [2019-11-15 21:26:24,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:24,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023528061] [2019-11-15 21:26:24,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:24,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:24,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48386806] [2019-11-15 21:26:24,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:24,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:24,309 INFO L87 Difference]: Start difference. First operand 432 states and 545 transitions. Second operand 4 states. [2019-11-15 21:26:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:24,460 INFO L93 Difference]: Finished difference Result 867 states and 1094 transitions. [2019-11-15 21:26:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:24,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-15 21:26:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:24,466 INFO L225 Difference]: With dead ends: 867 [2019-11-15 21:26:24,466 INFO L226 Difference]: Without dead ends: 665 [2019-11-15 21:26:24,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-15 21:26:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 434. [2019-11-15 21:26:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-15 21:26:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2019-11-15 21:26:24,532 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 166 [2019-11-15 21:26:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:24,533 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2019-11-15 21:26:24,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2019-11-15 21:26:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 21:26:24,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:24,537 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:26:24,538 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1716627662, now seen corresponding path program 1 times [2019-11-15 21:26:24,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:24,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26283554] [2019-11-15 21:26:24,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:24,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26283554] [2019-11-15 21:26:24,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:24,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:24,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145611068] [2019-11-15 21:26:24,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:24,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:24,763 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 5 states. [2019-11-15 21:26:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:24,874 INFO L93 Difference]: Finished difference Result 638 states and 804 transitions. [2019-11-15 21:26:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:24,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-11-15 21:26:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:24,877 INFO L225 Difference]: With dead ends: 638 [2019-11-15 21:26:24,877 INFO L226 Difference]: Without dead ends: 433 [2019-11-15 21:26:24,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-15 21:26:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2019-11-15 21:26:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-15 21:26:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 542 transitions. [2019-11-15 21:26:24,932 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 542 transitions. Word has length 167 [2019-11-15 21:26:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:24,932 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 542 transitions. [2019-11-15 21:26:24,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 542 transitions. [2019-11-15 21:26:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-15 21:26:24,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:24,935 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:26:24,936 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1594428674, now seen corresponding path program 1 times [2019-11-15 21:26:24,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:24,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530194323] [2019-11-15 21:26:24,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 21:26:25,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530194323] [2019-11-15 21:26:25,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:25,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:26:25,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654330161] [2019-11-15 21:26:25,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:26:25,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:26:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:26:25,198 INFO L87 Difference]: Start difference. First operand 431 states and 542 transitions. Second operand 6 states. [2019-11-15 21:26:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:25,675 INFO L93 Difference]: Finished difference Result 1774 states and 2256 transitions. [2019-11-15 21:26:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:26:25,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-11-15 21:26:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:25,684 INFO L225 Difference]: With dead ends: 1774 [2019-11-15 21:26:25,684 INFO L226 Difference]: Without dead ends: 1349 [2019-11-15 21:26:25,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:26:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-11-15 21:26:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 475. [2019-11-15 21:26:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-15 21:26:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 594 transitions. [2019-11-15 21:26:25,761 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 594 transitions. Word has length 175 [2019-11-15 21:26:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:25,762 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 594 transitions. [2019-11-15 21:26:25,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:26:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 594 transitions. [2019-11-15 21:26:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 21:26:25,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:25,765 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:26:25,765 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 329420158, now seen corresponding path program 1 times [2019-11-15 21:26:25,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:25,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296655819] [2019-11-15 21:26:25,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:25,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:25,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:26:26,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296655819] [2019-11-15 21:26:26,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196329491] [2019-11-15 21:26:26,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:27,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 2267 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:26:27,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:26:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:26:27,453 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:26:27,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-15 21:26:27,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751129139] [2019-11-15 21:26:27,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:26:27,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:27,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:26:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:26:27,456 INFO L87 Difference]: Start difference. First operand 475 states and 594 transitions. Second operand 12 states. [2019-11-15 21:26:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:27,950 INFO L93 Difference]: Finished difference Result 475 states and 594 transitions. [2019-11-15 21:26:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:26:27,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 181 [2019-11-15 21:26:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:27,952 INFO L225 Difference]: With dead ends: 475 [2019-11-15 21:26:27,952 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:26:27,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:26:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:26:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:26:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:26:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:26:27,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2019-11-15 21:26:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:27,954 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:26:27,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:26:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:26:27,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:26:28,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:28,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:26:28,415 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:28,544 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2019-11-15 21:26:28,712 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 89 [2019-11-15 21:26:28,840 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2019-11-15 21:26:28,993 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 87 [2019-11-15 21:26:29,231 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2019-11-15 21:26:29,415 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2019-11-15 21:26:29,529 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2019-11-15 21:26:29,754 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:29,856 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 81 [2019-11-15 21:26:30,149 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 101 [2019-11-15 21:26:30,410 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:30,864 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 138 [2019-11-15 21:26:31,112 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:31,400 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:31,642 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:32,200 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-11-15 21:26:32,518 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 87 [2019-11-15 21:26:33,949 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2019-11-15 21:26:34,212 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 100 [2019-11-15 21:26:35,076 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 111 [2019-11-15 21:26:35,392 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 118 [2019-11-15 21:26:35,709 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 140 [2019-11-15 21:26:36,157 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 137 [2019-11-15 21:26:36,885 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 156 [2019-11-15 21:26:37,349 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:37,536 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:37,796 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:38,057 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:38,186 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:38,487 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:38,662 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-11-15 21:26:38,972 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:39,180 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 20 [2019-11-15 21:26:39,395 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:39,613 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:40,013 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:40,212 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:40,512 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 20 [2019-11-15 21:26:40,682 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 27 [2019-11-15 21:26:40,980 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:41,171 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:41,433 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-11-15 21:26:41,642 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:41,788 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-11-15 21:26:42,206 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 40 [2019-11-15 21:26:42,358 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:42,521 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 22 [2019-11-15 21:26:42,754 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:43,141 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 52 [2019-11-15 21:26:43,323 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:43,543 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:43,690 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-11-15 21:26:43,875 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-11-15 21:26:44,035 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 27 [2019-11-15 21:26:44,259 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:44,430 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:44,619 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 22 [2019-11-15 21:26:44,765 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-11-15 21:26:44,914 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 27 [2019-11-15 21:26:45,143 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:45,368 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:45,586 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:45,746 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 22 [2019-11-15 21:26:45,918 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:46,122 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:46,294 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:46,513 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:46,736 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:46,962 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:47,202 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:47,423 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:47,601 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:47,889 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:48,108 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:48,341 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:48,568 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2019-11-15 21:26:48,737 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:48,910 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:49,150 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:49,404 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:49,858 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2019-11-15 21:26:50,077 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:50,212 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2019-11-15 21:26:50,368 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:50,539 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:50,777 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:51,003 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:51,275 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 20 [2019-11-15 21:26:51,437 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:51,664 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:51,835 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:52,130 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:52,235 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:52,392 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-11-15 21:26:52,563 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:52,785 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:53,044 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2019-11-15 21:26:53,215 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:53,522 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 20 [2019-11-15 21:26:53,695 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:53,916 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:54,196 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 20 [2019-11-15 21:26:54,657 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 20 [2019-11-15 21:26:54,983 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2019-11-15 21:26:55,208 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:55,438 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:55,687 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:56,081 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 40 [2019-11-15 21:26:56,329 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:56,590 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:56,830 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:57,003 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-11-15 21:26:57,155 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-15 21:26:57,311 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 20 [2019-11-15 21:26:57,537 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:57,639 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2019-11-15 21:26:58,350 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 20 [2019-11-15 21:26:58,572 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 20 [2019-11-15 21:26:58,692 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-11-15 21:26:58,694 INFO L439 ceAbstractionStarter]: At program point L1853(lines 1827 1855) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,694 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1628) no Hoare annotation was computed. [2019-11-15 21:26:58,694 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 1622 1628) no Hoare annotation was computed. [2019-11-15 21:26:58,695 INFO L439 ceAbstractionStarter]: At program point L1556(lines 1553 1558) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,695 INFO L443 ceAbstractionStarter]: For program point L1622-2(lines 1622 1628) no Hoare annotation was computed. [2019-11-15 21:26:58,695 INFO L443 ceAbstractionStarter]: For program point L2151(lines 2151 2154) no Hoare annotation was computed. [2019-11-15 21:26:58,695 INFO L439 ceAbstractionStarter]: At program point L1953(lines 1938 1959) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and .cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse2) (and (and (<= 6 ~ldv_count_1~0) .cse2 (= 0 ~ldv_count_2~0)) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1)))) [2019-11-15 21:26:58,695 INFO L439 ceAbstractionStarter]: At program point L2548(lines 2547 2549) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,695 INFO L439 ceAbstractionStarter]: At program point L2548-2(lines 2547 2549) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,695 INFO L439 ceAbstractionStarter]: At program point L2548-1(lines 2547 2549) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L2350(lines 2322 2362) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,696 INFO L443 ceAbstractionStarter]: For program point L2020(lines 2020 2023) no Hoare annotation was computed. [2019-11-15 21:26:58,696 INFO L443 ceAbstractionStarter]: For program point L1921(lines 1921 1924) no Hoare annotation was computed. [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L1723(lines 1705 1725) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L2582(lines 2581 2583) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L2483(lines 2471 2485) the Hoare annotation is: (let ((.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse1 (= ULTIMATE.start_create_sensor_~type 2)) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse4 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse6 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse4 .cse3 .cse6 .cse5))) [2019-11-15 21:26:58,696 INFO L443 ceAbstractionStarter]: For program point L1988(lines 1988 1993) no Hoare annotation was computed. [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L1955(lines 1938 1959) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and .cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse2) (and (and (<= 6 ~ldv_count_1~0) .cse2 (= 0 ~ldv_count_2~0)) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1)))) [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L2451(lines 2447 2453) the Hoare annotation is: (let ((.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse5 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse1 (= ULTIMATE.start_create_sensor_~type 2)) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse4 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse6 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (and .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5))) (and .cse0 .cse4 .cse3 .cse6) (and .cse1 .cse2 .cse3 .cse5) (and .cse4 .cse3 .cse5 .cse6) (and (<= 7 ~ldv_count_1~0) (let ((.cse7 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse8 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)))) (or (and .cse7 .cse8 .cse1 .cse2) (and .cse7 .cse4 .cse8 .cse6))) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)))) [2019-11-15 21:26:58,696 INFO L439 ceAbstractionStarter]: At program point L2385(lines 2380 2387) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L1692(lines 1692 1695) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L1692-1(lines 1692 1695) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L1692-2(lines 1692 1695) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L2353(lines 2353 2356) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L2254(lines 2254 2258) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L2254-2(lines 2254 2258) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L443 ceAbstractionStarter]: For program point L2056(lines 2056 2059) no Hoare annotation was computed. [2019-11-15 21:26:58,697 INFO L439 ceAbstractionStarter]: At program point L1693(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,697 INFO L439 ceAbstractionStarter]: At program point L1693-1(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,697 INFO L439 ceAbstractionStarter]: At program point L1627(lines 1620 1629) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,697 INFO L439 ceAbstractionStarter]: At program point L1693-2(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,698 INFO L439 ceAbstractionStarter]: At program point L1627-1(lines 1620 1629) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,698 INFO L439 ceAbstractionStarter]: At program point L2552(lines 2551 2553) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) [2019-11-15 21:26:58,698 INFO L439 ceAbstractionStarter]: At program point L1627-2(lines 1620 1629) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse8 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse10 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse9 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (= ULTIMATE.start_create_sensor_~type 2)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse7 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse7 .cse9) (and .cse0 .cse6 .cse10 .cse9 .cse8) (and .cse6 .cse7 .cse9 .cse8) (and .cse0 .cse6 .cse1 .cse4 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse9) (and .cse5 .cse2 .cse3 .cse7))) [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-1(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-3(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-2(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-5(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-4(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L439 ceAbstractionStarter]: At program point L2354(lines 2322 2362) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-7(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,698 INFO L446 ceAbstractionStarter]: At program point L2585-9(lines 1 2587) the Hoare annotation is: true [2019-11-15 21:26:58,698 INFO L443 ceAbstractionStarter]: For program point L2585-8(lines 2585 2587) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L439 ceAbstractionStarter]: At program point L1958(lines 1933 1960) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and .cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0 .cse2) (and (and (<= 6 ~ldv_count_1~0) .cse2 (= 0 ~ldv_count_2~0)) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1)))) [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point L2157(lines 2157 2162) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point L1926(lines 1926 1929) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L439 ceAbstractionStarter]: At program point L1564(lines 1559 1566) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point L2126(lines 2126 2130) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point L2093(lines 2093 2096) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L439 ceAbstractionStarter]: At program point L1994(lines 1961 1996) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse1 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse4 (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse8 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse6 (= ULTIMATE.start_create_sensor_~type 2)) (.cse7 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) (or (and .cse4 (and .cse5 .cse6 .cse7 .cse8)) (and .cse5 .cse1 .cse4 .cse8 .cse3))) (and .cse1 .cse2 .cse8 .cse3) (and (let ((.cse9 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)))) (or (and .cse4 (and .cse5 (and .cse9 .cse6 .cse7))) (and .cse5 .cse1 .cse4 .cse9 .cse3))) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and (and .cse6 .cse7 .cse8) .cse2) (and .cse0 (and .cse2 (and .cse6 .cse7))))) [2019-11-15 21:26:58,699 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,699 INFO L439 ceAbstractionStarter]: At program point L1598(lines 1592 1600) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,699 INFO L446 ceAbstractionStarter]: At program point L2556(lines 2555 2557) the Hoare annotation is: true [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L2523-1(lines 2522 2524) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L2523(lines 2522 2524) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,700 INFO L446 ceAbstractionStarter]: At program point L2523-2(lines 2522 2524) the Hoare annotation is: true [2019-11-15 21:26:58,700 INFO L443 ceAbstractionStarter]: For program point L2259(lines 2259 2266) no Hoare annotation was computed. [2019-11-15 21:26:58,700 INFO L443 ceAbstractionStarter]: For program point L2259-2(lines 2259 2266) no Hoare annotation was computed. [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L2061(lines 2009 2114) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse10 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (let ((.cse9 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse4 (and .cse2 .cse10)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse7 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse8 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse6 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse5 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and (and .cse0 (and .cse1 .cse2)) .cse3) (and .cse4 .cse5) (and .cse6 .cse7 .cse5 .cse8) (and .cse0 .cse7 .cse9 .cse10 .cse8) (and .cse9 (and .cse0 .cse4)) (and .cse0 .cse7 .cse3 .cse1 .cse8) (and .cse7 .cse5 .cse10 .cse8) (and .cse6 .cse5 .cse2)))) [2019-11-15 21:26:58,700 INFO L443 ceAbstractionStarter]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L1632(lines 1630 1633) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L1632-1(lines 1630 1633) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,700 INFO L439 ceAbstractionStarter]: At program point L1632-2(lines 1630 1633) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse8 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse10 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse9 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (= ULTIMATE.start_create_sensor_~type 2)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse7 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse7 .cse9) (and .cse0 .cse6 .cse10 .cse9 .cse8) (and .cse6 .cse7 .cse9 .cse8) (and .cse0 .cse6 .cse1 .cse4 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse9) (and .cse5 .cse2 .cse3 .cse7))) [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2458(lines 2458 2466) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2458-2(lines 2458 2466) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2458-1(lines 2458 2466) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2458-3(lines 2458 2466) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L439 ceAbstractionStarter]: At program point L1930(lines 1917 1932) the Hoare annotation is: (let ((.cse5 (= 0 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1 0)) (.cse11 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (let ((.cse4 (<= 6 ~ldv_count_1~0)) (.cse6 (= 0 ~ldv_count_2~0)) (.cse7 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse0 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse2 (and .cse3 .cse11)) (.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse1 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse9 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse10 (and .cse3 .cse5 .cse11))) (or (and .cse0 (and .cse1 .cse2)) (and (and .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse8 (and .cse3 .cse5 .cse9)) (and (and .cse1 (and .cse3 .cse4 .cse6)) .cse7) (and .cse0 .cse10) (and .cse1 .cse9 .cse2) (and .cse3 .cse8 .cse1 .cse9) (and .cse9 .cse10)))) [2019-11-15 21:26:58,701 INFO L439 ceAbstractionStarter]: At program point L1666(lines 1661 1668) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,701 INFO L439 ceAbstractionStarter]: At program point L2393(lines 2388 2395) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0) (= 0 ~ldv_count_2~0)))) [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2195-1(lines 2195 2198) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L2195(lines 2195 2198) no Hoare annotation was computed. [2019-11-15 21:26:58,701 INFO L439 ceAbstractionStarter]: At program point L2063(lines 2009 2114) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse10 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (let ((.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse7 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse4 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse5 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse6 (and .cse2 .cse10)) (.cse8 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse9 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and (and .cse0 (and .cse1 .cse2)) .cse3) (and .cse0 .cse4 .cse1 .cse3 .cse5) (and (and .cse0 .cse6) .cse7) (and .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse4 .cse7 .cse10 .cse5) (and .cse4 .cse9 .cse10 .cse5) (and .cse9 .cse6) (and .cse8 .cse9 .cse2)))) [2019-11-15 21:26:58,701 INFO L443 ceAbstractionStarter]: For program point L1733(line 1733) no Hoare annotation was computed. [2019-11-15 21:26:58,702 INFO L443 ceAbstractionStarter]: For program point L1733-2(lines 1733 1736) no Hoare annotation was computed. [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526-2(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526-1(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526-4(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526-3(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L446 ceAbstractionStarter]: At program point L2526-6(lines 2525 2527) the Hoare annotation is: true [2019-11-15 21:26:58,702 INFO L439 ceAbstractionStarter]: At program point L2526-5(lines 2525 2527) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,702 INFO L446 ceAbstractionStarter]: At program point L2361(lines 2312 2363) the Hoare annotation is: true [2019-11-15 21:26:58,702 INFO L446 ceAbstractionStarter]: At program point L2526-8(lines 2525 2527) the Hoare annotation is: true [2019-11-15 21:26:58,702 INFO L446 ceAbstractionStarter]: At program point L2526-7(lines 2525 2527) the Hoare annotation is: true [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2560(lines 2559 2561) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2560-2(lines 2559 2561) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2560-1(lines 2559 2561) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L443 ceAbstractionStarter]: For program point L2461(lines 2461 2464) no Hoare annotation was computed. [2019-11-15 21:26:58,703 INFO L443 ceAbstractionStarter]: For program point L2461-2(lines 2461 2464) no Hoare annotation was computed. [2019-11-15 21:26:58,703 INFO L443 ceAbstractionStarter]: For program point L2230(lines 2230 2233) no Hoare annotation was computed. [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L1702(lines 1680 1704) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L1702-1(lines 1680 1704) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L1702-2(lines 1680 1704) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2495(lines 1 2587) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2066(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,703 INFO L439 ceAbstractionStarter]: At program point L2099(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L443 ceAbstractionStarter]: For program point L2033(lines 2033 2050) no Hoare annotation was computed. [2019-11-15 21:26:58,704 INFO L443 ceAbstractionStarter]: For program point L2166(lines 2166 2171) no Hoare annotation was computed. [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L1737(lines 1726 1739) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L1572(lines 1567 1574) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L2530(lines 2529 2531) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:26:58,704 INFO L446 ceAbstractionStarter]: At program point L2299(lines 2287 2305) the Hoare annotation is: true [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L2068(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L2101(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L446 ceAbstractionStarter]: At program point L2201-1(lines 2186 2221) the Hoare annotation is: true [2019-11-15 21:26:58,704 INFO L439 ceAbstractionStarter]: At program point L2201(lines 2186 2221) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,704 INFO L443 ceAbstractionStarter]: For program point L2069(lines 2069 2072) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L443 ceAbstractionStarter]: For program point L1970(lines 1970 1973) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L439 ceAbstractionStarter]: At program point L1640(lines 1635 1642) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,705 INFO L439 ceAbstractionStarter]: At program point L1640-1(lines 1635 1642) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,705 INFO L439 ceAbstractionStarter]: At program point L1640-2(lines 1635 1642) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse8 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse10 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse9 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (= ULTIMATE.start_create_sensor_~type 2)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse7 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse7 .cse9) (and .cse0 .cse6 .cse10 .cse9 .cse8) (and .cse6 .cse7 .cse9 .cse8) (and .cse0 .cse6 .cse1 .cse4 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse9) (and .cse5 .cse2 .cse3 .cse7))) [2019-11-15 21:26:58,705 INFO L439 ceAbstractionStarter]: At program point L2499(lines 2498 2500) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,705 INFO L443 ceAbstractionStarter]: For program point L2400(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L443 ceAbstractionStarter]: For program point L2400-2(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2349) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L443 ceAbstractionStarter]: For program point L2400-1(line 2400) no Hoare annotation was computed. [2019-11-15 21:26:58,705 INFO L446 ceAbstractionStarter]: At program point L2301(lines 2287 2305) the Hoare annotation is: true [2019-11-15 21:26:58,707 INFO L439 ceAbstractionStarter]: At program point L2169(lines 2123 2180) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,707 INFO L439 ceAbstractionStarter]: At program point L2070(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,707 INFO L439 ceAbstractionStarter]: At program point L2103(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,707 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 1908) no Hoare annotation was computed. [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2566(lines 2565 2567) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2533-1(lines 2532 2534) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2566-2(lines 2565 2567) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2533(lines 2532 2534) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2566-1(lines 2565 2567) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,708 INFO L439 ceAbstractionStarter]: At program point L2467-1(lines 2455 2469) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0) (= 0 ~ldv_count_2~0)))) [2019-11-15 21:26:58,709 INFO L439 ceAbstractionStarter]: At program point L2467(lines 2455 2469) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,709 INFO L446 ceAbstractionStarter]: At program point L2566-3(lines 2565 2567) the Hoare annotation is: true [2019-11-15 21:26:58,709 INFO L446 ceAbstractionStarter]: At program point L2533-2(lines 2532 2534) the Hoare annotation is: true [2019-11-15 21:26:58,709 INFO L443 ceAbstractionStarter]: For program point L2335(line 2335) no Hoare annotation was computed. [2019-11-15 21:26:58,709 INFO L446 ceAbstractionStarter]: At program point L2203-1(lines 2186 2221) the Hoare annotation is: true [2019-11-15 21:26:58,709 INFO L439 ceAbstractionStarter]: At program point L2203(lines 2186 2221) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,709 INFO L443 ceAbstractionStarter]: For program point L1939(lines 1939 1942) no Hoare annotation was computed. [2019-11-15 21:26:58,710 INFO L439 ceAbstractionStarter]: At program point L2369(lines 2364 2371) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,710 INFO L443 ceAbstractionStarter]: For program point L2138(lines 2138 2143) no Hoare annotation was computed. [2019-11-15 21:26:58,710 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 1844) no Hoare annotation was computed. [2019-11-15 21:26:58,710 INFO L439 ceAbstractionStarter]: At program point L2502(lines 2501 2503) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,710 INFO L446 ceAbstractionStarter]: At program point L2304(lines 2562 2564) the Hoare annotation is: true [2019-11-15 21:26:58,710 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:26:58,711 INFO L446 ceAbstractionStarter]: At program point L2205-1(lines 2186 2221) the Hoare annotation is: true [2019-11-15 21:26:58,711 INFO L439 ceAbstractionStarter]: At program point L2205(lines 2186 2221) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,711 INFO L443 ceAbstractionStarter]: For program point L1974(lines 1974 1980) no Hoare annotation was computed. [2019-11-15 21:26:58,711 INFO L446 ceAbstractionStarter]: At program point L2569-1(lines 2568 2570) the Hoare annotation is: true [2019-11-15 21:26:58,711 INFO L439 ceAbstractionStarter]: At program point L2569(lines 2568 2570) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,711 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2077) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L439 ceAbstractionStarter]: At program point L2107(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,712 INFO L439 ceAbstractionStarter]: At program point L2537(lines 2536 2538) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point L2339(line 2339) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point L2042(lines 2042 2049) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point L2042-1(lines 2033 2050) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point L1910(lines 1910 1913) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L439 ceAbstractionStarter]: At program point L2505(lines 2504 2506) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,712 INFO L439 ceAbstractionStarter]: At program point L2175(lines 2123 2180) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,712 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:26:58,712 INFO L439 ceAbstractionStarter]: At program point L2109(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L1977(lines 1977 1980) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L1977-2(lines 1974 1980) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L1713(line 1713) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L1713-2(lines 1713 1716) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L446 ceAbstractionStarter]: At program point L2209-1(lines 2186 2221) the Hoare annotation is: true [2019-11-15 21:26:58,713 INFO L439 ceAbstractionStarter]: At program point L2209(lines 2186 2221) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,713 INFO L439 ceAbstractionStarter]: At program point L1648(lines 1643 1650) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,713 INFO L439 ceAbstractionStarter]: At program point L1648-1(lines 1643 1650) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L2474(lines 2474 2482) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L2474-1(lines 2474 2482) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L439 ceAbstractionStarter]: At program point L2177(lines 2123 2180) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L2210-1(lines 2210 2213) no Hoare annotation was computed. [2019-11-15 21:26:58,713 INFO L443 ceAbstractionStarter]: For program point L1748(line 1748) no Hoare annotation was computed. [2019-11-15 21:26:58,714 INFO L443 ceAbstractionStarter]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2019-11-15 21:26:58,714 INFO L439 ceAbstractionStarter]: At program point L1583(lines 1579 1585) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,714 INFO L439 ceAbstractionStarter]: At program point L2541-1(lines 2540 2542) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,714 INFO L439 ceAbstractionStarter]: At program point L2541(lines 2540 2542) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,714 INFO L446 ceAbstractionStarter]: At program point L2541-2(lines 2540 2542) the Hoare annotation is: true [2019-11-15 21:26:58,714 INFO L443 ceAbstractionStarter]: For program point L2343(line 2343) no Hoare annotation was computed. [2019-11-15 21:26:58,714 INFO L439 ceAbstractionStarter]: At program point L2277(lines 2272 2279) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) [2019-11-15 21:26:58,715 INFO L446 ceAbstractionStarter]: At program point L2211-1(lines 2186 2221) the Hoare annotation is: true [2019-11-15 21:26:58,715 INFO L439 ceAbstractionStarter]: At program point L2211(lines 2186 2221) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,715 INFO L443 ceAbstractionStarter]: For program point L2079(lines 2079 2082) no Hoare annotation was computed. [2019-11-15 21:26:58,715 INFO L443 ceAbstractionStarter]: For program point L2013(lines 2013 2016) no Hoare annotation was computed. [2019-11-15 21:26:58,715 INFO L439 ceAbstractionStarter]: At program point L1914(lines 1901 1916) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0) (= 0 ~ldv_count_2~0)))) [2019-11-15 21:26:58,715 INFO L439 ceAbstractionStarter]: At program point L1848(lines 1834 1854) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,716 INFO L439 ceAbstractionStarter]: At program point L2377(lines 2372 2379) the Hoare annotation is: (let ((.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse1 (= ULTIMATE.start_create_sensor_~type 2)) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse4 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse6 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse4 .cse3 .cse6 .cse5))) [2019-11-15 21:26:58,716 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2009 2114) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,716 INFO L439 ceAbstractionStarter]: At program point L2113(lines 1997 2115) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,716 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:26:58,716 INFO L439 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,716 INFO L443 ceAbstractionStarter]: For program point L1948(lines 1948 1951) no Hoare annotation was computed. [2019-11-15 21:26:58,717 INFO L439 ceAbstractionStarter]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,717 INFO L443 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-15 21:26:58,717 INFO L443 ceAbstractionStarter]: For program point L2477(lines 2477 2480) no Hoare annotation was computed. [2019-11-15 21:26:58,717 INFO L443 ceAbstractionStarter]: For program point L2246(lines 2246 2252) no Hoare annotation was computed. [2019-11-15 21:26:58,717 INFO L439 ceAbstractionStarter]: At program point L1850(lines 1834 1854) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,717 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1688) no Hoare annotation was computed. [2019-11-15 21:26:58,718 INFO L443 ceAbstractionStarter]: For program point L1685-1(lines 1685 1688) no Hoare annotation was computed. [2019-11-15 21:26:58,718 INFO L443 ceAbstractionStarter]: For program point L1685-2(lines 1685 1688) no Hoare annotation was computed. [2019-11-15 21:26:58,718 INFO L439 ceAbstractionStarter]: At program point L2544-1(lines 2543 2545) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,718 INFO L439 ceAbstractionStarter]: At program point L2412(lines 2409 2414) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,718 INFO L439 ceAbstractionStarter]: At program point L2412-2(lines 2409 2414) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,718 INFO L439 ceAbstractionStarter]: At program point L2412-1(lines 2409 2414) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,719 INFO L439 ceAbstractionStarter]: At program point L2412-3(lines 2409 2414) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_is_temp_sensor_#res|)) (.cse1 (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0))) (.cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (.cse8 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___0~2 1)) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse10 (<= ~ldv_count_2~0 ~ldv_count_1~0)) (.cse9 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse5 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (= ULTIMATE.start_create_sensor_~type 2)) (.cse3 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2)) (.cse7 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse7 .cse9) (and .cse0 .cse6 .cse10 .cse9 .cse8) (and .cse6 .cse7 .cse9 .cse8) (and .cse0 .cse6 .cse1 .cse4 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse9) (and .cse5 .cse2 .cse3 .cse7))) [2019-11-15 21:26:58,719 INFO L439 ceAbstractionStarter]: At program point L1752(lines 1740 1754) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,719 INFO L439 ceAbstractionStarter]: At program point L1686(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,719 INFO L439 ceAbstractionStarter]: At program point L1686-1(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,719 INFO L439 ceAbstractionStarter]: At program point L1686-2(lines 1683 1703) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,720 INFO L439 ceAbstractionStarter]: At program point L2578(lines 2577 2579) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,720 INFO L439 ceAbstractionStarter]: At program point L2578-2(lines 2577 2579) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,720 INFO L439 ceAbstractionStarter]: At program point L2578-1(lines 2577 2579) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= 0 ~ldv_count_2~0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-11-15 21:26:58,720 INFO L443 ceAbstractionStarter]: For program point L2347(line 2347) no Hoare annotation was computed. [2019-11-15 21:26:58,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:26:58 BoogieIcfgContainer [2019-11-15 21:26:58,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:26:58,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:26:58,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:26:58,789 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:26:58,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:15" (3/4) ... [2019-11-15 21:26:58,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:26:58,824 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 148 nodes and edges [2019-11-15 21:26:58,836 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-11-15 21:26:58,839 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-15 21:26:58,842 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 21:26:58,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 21:26:58,893 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_2 <= ldv_count_1 && 1 == \result && tmp___1 == 0 && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((((tmp___1 == 0 && 6 <= ldv_count_1) && 0 == \result) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && (tmp___1 == 0 && 0 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || ((1 == \result && (tmp___1 == 0 && 6 <= ldv_count_1) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 <= ldv_count_1 && (tmp___1 == 0 && 0 == \result) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___1 == 0 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((tmp___1 == 0 && ldv_count_2 + 1 <= ldv_count_1) && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && (tmp___1 == 0 && 0 == \result) && ldv_call_dev_attr_of_sensor_device_attribute == 1) [2019-11-15 21:26:58,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((j == 0 && (6 <= ldv_count_1 && 0 == ldv_count_2) && sensor_type == 2) && err == 0) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (ldv_count_2 <= ldv_count_1 && j == 0 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && err == 0) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2) [2019-11-15 21:26:58,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((j == 0 && (6 <= ldv_count_1 && 0 == ldv_count_2) && sensor_type == 2) && err == 0) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((j == 0 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) && ldv_count_2 <= ldv_count_1)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2) [2019-11-15 21:26:58,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) [2019-11-15 21:26:58,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) [2019-11-15 21:26:58,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) [2019-11-15 21:26:58,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) [2019-11-15 21:26:58,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1) || (ldv_count_2 <= ldv_count_1 && ((\result + 12 <= 0 && ((j == 0 && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((((j == 0 && 1 == \result) && \result + 12 <= 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)))) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((\result + 12 <= 0 && j == 0 && ((6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) || ((((j == 0 && 1 == \result) && \result + 12 <= 0) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1)) && err == 0)) || (((type == 2 && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && type == 2 && sensor_type == 2) [2019-11-15 21:26:58,896 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && (((1 == \result && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) || ((type == 2 && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)))) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((7 <= ldv_count_1 && ((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) || (((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1))) && err == 0) [2019-11-15 21:26:58,896 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) [2019-11-15 21:26:58,896 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) [2019-11-15 21:26:59,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85975039-1065-4a34-bd5f-7f3ca2173f27/bin/uautomizer/witness.graphml [2019-11-15 21:26:59,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:26:59,046 INFO L168 Benchmark]: Toolchain (without parser) took 47296.48 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.8 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 466.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,046 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:26:59,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1155.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,047 INFO L168 Benchmark]: Boogie Preprocessor took 164.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,048 INFO L168 Benchmark]: RCFGBuilder took 1917.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 888.9 MB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,048 INFO L168 Benchmark]: TraceAbstraction took 43637.43 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 888.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,048 INFO L168 Benchmark]: Witness Printer took 255.51 ms. Allocated memory is still 2.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:59,050 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1155.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1917.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 888.9 MB in the end (delta: 182.3 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43637.43 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 888.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 255.51 ms. Allocated memory is still 2.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2400]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2400]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2400]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 2522]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2364]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1997]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2372]: Loop Invariant Derived loop invariant: (((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2577]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2522]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2577]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2555]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2522]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2577]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1740]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1938]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2)) || (((6 <= ldv_count_1 && sensor_type == 2) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 <= ldv_count_1 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: (((((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && (((1 == \result && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) || ((type == 2 && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)))) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((7 <= ldv_count_1 && ((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) || (((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1))) && err == 0) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2380]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: ((((((((j == 0 && (6 <= ldv_count_1 && 0 == ldv_count_2) && sensor_type == 2) && err == 0) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((j == 0 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) && ldv_count_2 <= ldv_count_1)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2) - InvariantResult [Line: 1680]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2388]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((6 <= ldv_count_1 && err == 0) && 0 == ldv_count_2) - InvariantResult [Line: 1834]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && 0 == ldv_count_2 - InvariantResult [Line: 1961]: Loop Invariant Derived loop invariant: (((((((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1) || (ldv_count_2 <= ldv_count_1 && ((\result + 12 <= 0 && ((j == 0 && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((((j == 0 && 1 == \result) && \result + 12 <= 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)))) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((\result + 12 <= 0 && j == 0 && ((6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) || ((((j == 0 && 1 == \result) && \result + 12 <= 0) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1)) && err == 0)) || (((type == 2 && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && type == 2 && sensor_type == 2) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2409]: Loop Invariant Derived loop invariant: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1933]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2)) || (((6 <= ldv_count_1 && sensor_type == 2) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 <= ldv_count_1 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1680]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1680]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1901]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((6 <= ldv_count_1 && err == 0) && 0 == ldv_count_2) - InvariantResult [Line: 2565]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2532]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2455]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1938]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2)) || (((6 <= ldv_count_1 && sensor_type == 2) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 <= ldv_count_1 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2565]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2532]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2455]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((6 <= ldv_count_1 && err == 0) && 0 == ldv_count_2) - InvariantResult [Line: 1661]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2409]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2409]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2409]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1827]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2565]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1559]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2543]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2565]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2532]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2272]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && 0 == ldv_count_2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) - InvariantResult [Line: 1567]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2529]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2540]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2551]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && 0 == ldv_count_2 - InvariantResult [Line: 2540]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2540]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1917]: Loop Invariant Derived loop invariant: (((((((ldv_count_2 <= ldv_count_1 && 1 == \result && tmp___1 == 0 && ldv_call_dev_attr_of_sensor_device_attribute == 1) || ((((tmp___1 == 0 && 6 <= ldv_count_1) && 0 == \result) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && (tmp___1 == 0 && 0 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || ((1 == \result && (tmp___1 == 0 && 6 <= ldv_count_1) && 0 == ldv_count_2) && err == 0)) || (ldv_count_2 <= ldv_count_1 && (tmp___1 == 0 && 0 == \result) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___1 == 0 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((tmp___1 == 0 && ldv_count_2 + 1 <= ldv_count_1) && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && (tmp___1 == 0 && 0 == \result) && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2123]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2471]: Loop Invariant Derived loop invariant: (((((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1) - InvariantResult [Line: 2559]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2504]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1726]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2186]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1683]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1834]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1579]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2123]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2581]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2559]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2559]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) - InvariantResult [Line: 2287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1705]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2501]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2498]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2123]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1635]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1635]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1635]: Loop Invariant Derived loop invariant: ((((((((((j == 0 && 6 <= ldv_count_1 && 0 == ldv_count_2) && type == 2) && sensor_type == 2) && err == 0) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || (((type == 2 && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && 6 <= ldv_count_1 && 0 == ldv_count_2) && err == 0) && tmp___0 == 1)) || ((((j == 0 && ldv_count_2 <= ldv_count_1) && type == 2) && sensor_type == 2) && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || (((ldv_count_2 + 1 <= ldv_count_1 && type == 2) && sensor_type == 2) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2312]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: ((((((((j == 0 && (6 <= ldv_count_1 && 0 == ldv_count_2) && sensor_type == 2) && err == 0) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (((ldv_count_2 + 1 <= ldv_count_1 && 1 == \result) && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && tmp___0 == 1)) || ((((j == 0 && 1 == \result) && ldv_count_2 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || (ldv_count_2 <= ldv_count_1 && j == 0 && sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute == 1)) || ((((j == 0 && 1 == \result) && err == 0) && 6 <= ldv_count_1 && 0 == ldv_count_2) && tmp___0 == 1)) || (((1 == \result && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && ldv_call_dev_attr_of_sensor_device_attribute == 1) && tmp___0 == 1)) || ((ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && sensor_type == 2) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2547]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2536]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2547]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2547]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 2525]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: (((!(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_call_dev_attr_of_sensor_device_attribute == 1) || (6 <= ldv_count_1 && 0 == ldv_count_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0))) || (ldv_count_2 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 217 locations, 3 error locations. Result: SAFE, OverallTime: 43.5s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.5s, HoareTripleCheckerStatistics: 8901 SDtfs, 11908 SDslu, 19340 SDs, 0 SdLazy, 719 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=883occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 11316 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 1623 NumberOfFragments, 4559 HoareAnnotationTreeSize, 128 FomulaSimplifications, 139886535 FormulaSimplificationTreeSizeReduction, 8.8s HoareSimplificationTime, 128 FomulaSimplificationsInter, 2072807 FormulaSimplificationTreeSizeReductionInter, 21.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2504 NumberOfCodeBlocks, 2504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2481 ConstructedInterpolants, 0 QuantifiedInterpolants, 729993 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3707 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 251/379 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...