./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-commit-tester/m0_true-unreach-call_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-commit-tester/m0_true-unreach-call_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a48267cc38a14a49d080ca26bfcc4bd5a4be99e0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-15 11:50:52,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 11:50:52,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 11:50:52,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 11:50:52,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 11:50:52,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 11:50:52,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 11:50:52,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 11:50:52,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 11:50:52,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 11:50:52,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 11:50:52,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 11:50:52,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 11:50:52,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 11:50:52,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 11:50:52,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 11:50:52,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 11:50:52,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 11:50:52,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 11:50:52,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 11:50:52,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 11:50:52,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 11:50:52,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 11:50:52,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 11:50:52,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 11:50:52,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 11:50:52,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 11:50:52,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 11:50:52,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 11:50:52,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 11:50:52,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 11:50:52,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 11:50:52,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 11:50:52,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 11:50:52,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 11:50:52,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 11:50:52,628 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-15 11:50:52,644 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 11:50:52,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 11:50:52,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 11:50:52,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 11:50:52,645 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 11:50:52,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 11:50:52,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-15 11:50:52,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 11:50:52,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 11:50:52,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 11:50:52,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 11:50:52,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 11:50:52,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 11:50:52,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 11:50:52,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 11:50:52,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 11:50:52,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 11:50:52,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 11:50:52,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 11:50:52,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 11:50:52,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 11:50:52,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-15 11:50:52,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 11:50:52,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-15 11:50:52,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 11:50:52,649 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> a48267cc38a14a49d080ca26bfcc4bd5a4be99e0 [2019-01-15 11:50:52,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 11:50:52,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 11:50:52,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 11:50:52,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 11:50:52,701 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 11:50:52,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-commit-tester/m0_true-unreach-call_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-01-15 11:50:52,755 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b8fad12/3291a69e0af44b78b8c4af3f915c609e/FLAGe6e4c3aec [2019-01-15 11:50:53,331 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 11:50:53,333 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-commit-tester/m0_true-unreach-call_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-01-15 11:50:53,363 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b8fad12/3291a69e0af44b78b8c4af3f915c609e/FLAGe6e4c3aec [2019-01-15 11:50:53,527 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b8fad12/3291a69e0af44b78b8c4af3f915c609e [2019-01-15 11:50:53,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 11:50:53,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 11:50:53,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 11:50:53,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 11:50:53,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 11:50:53,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 11:50:53" (1/1) ... [2019-01-15 11:50:53,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6536dee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:53, skipping insertion in model container [2019-01-15 11:50:53,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 11:50:53" (1/1) ... [2019-01-15 11:50:53,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 11:50:53,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 11:50:54,448 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 11:50:54,571 INFO L191 MainTranslator]: Completed pre-run [2019-01-15 11:50:54,728 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 11:50:54,838 INFO L195 MainTranslator]: Completed translation [2019-01-15 11:50:54,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54 WrapperNode [2019-01-15 11:50:54,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-15 11:50:54,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-15 11:50:54,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-15 11:50:54,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-15 11:50:54,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:54,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-15 11:50:55,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-15 11:50:55,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-15 11:50:55,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-15 11:50:55,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... [2019-01-15 11:50:55,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-15 11:50:55,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-15 11:50:55,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-15 11:50:55,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-15 11:50:55,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-15 11:50:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-15 11:50:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-15 11:50:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-15 11:50:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-15 11:50:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-15 11:50:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-15 11:50:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-15 11:50:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-15 11:50:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-15 11:50:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-15 11:50:55,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-15 11:50:58,563 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-15 11:50:58,563 INFO L286 CfgBuilder]: Removed 222 assue(true) statements. [2019-01-15 11:50:58,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 11:50:58 BoogieIcfgContainer [2019-01-15 11:50:58,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-15 11:50:58,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-15 11:50:58,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-15 11:50:58,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-15 11:50:58,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 11:50:53" (1/3) ... [2019-01-15 11:50:58,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 11:50:58, skipping insertion in model container [2019-01-15 11:50:58,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 11:50:54" (2/3) ... [2019-01-15 11:50:58,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 11:50:58, skipping insertion in model container [2019-01-15 11:50:58,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 11:50:58" (3/3) ... [2019-01-15 11:50:58,572 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_true-unreach-call_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2019-01-15 11:50:58,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-15 11:50:58,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-15 11:50:58,603 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-15 11:50:58,639 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-15 11:50:58,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-15 11:50:58,639 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-15 11:50:58,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-15 11:50:58,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-15 11:50:58,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-15 11:50:58,640 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-15 11:50:58,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-15 11:50:58,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-15 11:50:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states. [2019-01-15 11:50:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-15 11:50:58,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:50:58,674 INFO L402 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-01-15 11:50:58,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:50:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:50:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1549084668, now seen corresponding path program 1 times [2019-01-15 11:50:58,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:50:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:50:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:50:58,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:50:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:50:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:50:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:50:59,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:50:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:50:59,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:50:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:50:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:50:59,324 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 4 states. [2019-01-15 11:50:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:50:59,582 INFO L93 Difference]: Finished difference Result 580 states and 761 transitions. [2019-01-15 11:50:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:50:59,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-15 11:50:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:50:59,614 INFO L225 Difference]: With dead ends: 580 [2019-01-15 11:50:59,614 INFO L226 Difference]: Without dead ends: 294 [2019-01-15 11:50:59,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:50:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-15 11:50:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 194. [2019-01-15 11:50:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-15 11:50:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 256 transitions. [2019-01-15 11:50:59,709 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 256 transitions. Word has length 59 [2019-01-15 11:50:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:50:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 256 transitions. [2019-01-15 11:50:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:50:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 256 transitions. [2019-01-15 11:50:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-15 11:50:59,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:50:59,712 INFO L402 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-01-15 11:50:59,712 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:50:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:50:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -967525942, now seen corresponding path program 1 times [2019-01-15 11:50:59,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:50:59,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:50:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:50:59,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:50:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:50:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:50:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:50:59,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:50:59,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:50:59,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:50:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:50:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:50:59,996 INFO L87 Difference]: Start difference. First operand 194 states and 256 transitions. Second operand 4 states. [2019-01-15 11:51:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:00,286 INFO L93 Difference]: Finished difference Result 471 states and 621 transitions. [2019-01-15 11:51:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:51:00,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-15 11:51:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:00,291 INFO L225 Difference]: With dead ends: 471 [2019-01-15 11:51:00,291 INFO L226 Difference]: Without dead ends: 283 [2019-01-15 11:51:00,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-01-15 11:51:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 196. [2019-01-15 11:51:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-15 11:51:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 258 transitions. [2019-01-15 11:51:00,312 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 258 transitions. Word has length 63 [2019-01-15 11:51:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:00,313 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 258 transitions. [2019-01-15 11:51:00,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 258 transitions. [2019-01-15 11:51:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-15 11:51:00,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:00,316 INFO L402 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-01-15 11:51:00,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1978643192, now seen corresponding path program 1 times [2019-01-15 11:51:00,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:00,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:00,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:00,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 11:51:00,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 11:51:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 11:51:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 11:51:00,571 INFO L87 Difference]: Start difference. First operand 196 states and 258 transitions. Second operand 3 states. [2019-01-15 11:51:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:00,669 INFO L93 Difference]: Finished difference Result 387 states and 512 transitions. [2019-01-15 11:51:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 11:51:00,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-15 11:51:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:00,674 INFO L225 Difference]: With dead ends: 387 [2019-01-15 11:51:00,674 INFO L226 Difference]: Without dead ends: 197 [2019-01-15 11:51:00,676 INFO L631 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-01-15 11:51:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-15 11:51:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-15 11:51:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-15 11:51:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 259 transitions. [2019-01-15 11:51:00,703 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 259 transitions. Word has length 63 [2019-01-15 11:51:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:00,704 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 259 transitions. [2019-01-15 11:51:00,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 11:51:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2019-01-15 11:51:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-15 11:51:00,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:00,709 INFO L402 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-01-15 11:51:00,710 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:00,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1036460426, now seen corresponding path program 1 times [2019-01-15 11:51:00,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:00,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-15 11:51:01,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-15 11:51:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-15 11:51:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-15 11:51:01,121 INFO L87 Difference]: Start difference. First operand 197 states and 259 transitions. Second operand 7 states. [2019-01-15 11:51:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:01,886 INFO L93 Difference]: Finished difference Result 828 states and 1105 transitions. [2019-01-15 11:51:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-15 11:51:01,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-01-15 11:51:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:01,892 INFO L225 Difference]: With dead ends: 828 [2019-01-15 11:51:01,893 INFO L226 Difference]: Without dead ends: 637 [2019-01-15 11:51:01,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-15 11:51:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-01-15 11:51:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 202. [2019-01-15 11:51:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-15 11:51:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 264 transitions. [2019-01-15 11:51:01,918 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 264 transitions. Word has length 63 [2019-01-15 11:51:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:01,919 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 264 transitions. [2019-01-15 11:51:01,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-15 11:51:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 264 transitions. [2019-01-15 11:51:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-15 11:51:01,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:01,924 INFO L402 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-01-15 11:51:01,925 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash 903798714, now seen corresponding path program 1 times [2019-01-15 11:51:01,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:01,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:02,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:02,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-15 11:51:02,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-15 11:51:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-15 11:51:02,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-15 11:51:02,276 INFO L87 Difference]: Start difference. First operand 202 states and 264 transitions. Second operand 7 states. [2019-01-15 11:51:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:02,826 INFO L93 Difference]: Finished difference Result 581 states and 767 transitions. [2019-01-15 11:51:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 11:51:02,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-01-15 11:51:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:02,831 INFO L225 Difference]: With dead ends: 581 [2019-01-15 11:51:02,831 INFO L226 Difference]: Without dead ends: 385 [2019-01-15 11:51:02,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-15 11:51:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-15 11:51:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 207. [2019-01-15 11:51:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-15 11:51:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 269 transitions. [2019-01-15 11:51:02,842 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 269 transitions. Word has length 64 [2019-01-15 11:51:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:02,842 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 269 transitions. [2019-01-15 11:51:02,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-15 11:51:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 269 transitions. [2019-01-15 11:51:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-15 11:51:02,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:02,844 INFO L402 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-01-15 11:51:02,844 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash -67843420, now seen corresponding path program 1 times [2019-01-15 11:51:02,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:02,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:03,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:03,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:03,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 11:51:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 11:51:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:03,096 INFO L87 Difference]: Start difference. First operand 207 states and 269 transitions. Second operand 5 states. [2019-01-15 11:51:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:03,549 INFO L93 Difference]: Finished difference Result 600 states and 786 transitions. [2019-01-15 11:51:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:03,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-15 11:51:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:03,553 INFO L225 Difference]: With dead ends: 600 [2019-01-15 11:51:03,553 INFO L226 Difference]: Without dead ends: 594 [2019-01-15 11:51:03,554 INFO L631 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-01-15 11:51:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-01-15 11:51:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 402. [2019-01-15 11:51:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-15 11:51:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 526 transitions. [2019-01-15 11:51:03,573 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 526 transitions. Word has length 65 [2019-01-15 11:51:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 526 transitions. [2019-01-15 11:51:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 11:51:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 526 transitions. [2019-01-15 11:51:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-15 11:51:03,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:03,575 INFO L402 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-01-15 11:51:03,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash 124897524, now seen corresponding path program 1 times [2019-01-15 11:51:03,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:03,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:03,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 11:51:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 11:51:03,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 11:51:03,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 11:51:03,720 INFO L87 Difference]: Start difference. First operand 402 states and 526 transitions. Second operand 3 states. [2019-01-15 11:51:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:03,918 INFO L93 Difference]: Finished difference Result 971 states and 1275 transitions. [2019-01-15 11:51:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 11:51:03,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-15 11:51:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:03,925 INFO L225 Difference]: With dead ends: 971 [2019-01-15 11:51:03,925 INFO L226 Difference]: Without dead ends: 768 [2019-01-15 11:51:03,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-15 11:51:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-01-15 11:51:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 766. [2019-01-15 11:51:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-01-15 11:51:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1005 transitions. [2019-01-15 11:51:03,965 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1005 transitions. Word has length 71 [2019-01-15 11:51:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:03,966 INFO L480 AbstractCegarLoop]: Abstraction has 766 states and 1005 transitions. [2019-01-15 11:51:03,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 11:51:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1005 transitions. [2019-01-15 11:51:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-15 11:51:03,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:03,971 INFO L402 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-01-15 11:51:03,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1127714545, now seen corresponding path program 1 times [2019-01-15 11:51:03,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:03,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-15 11:51:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:04,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:04,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:04,231 INFO L87 Difference]: Start difference. First operand 766 states and 1005 transitions. Second operand 4 states. [2019-01-15 11:51:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:04,783 INFO L93 Difference]: Finished difference Result 1902 states and 2482 transitions. [2019-01-15 11:51:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:04,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-15 11:51:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:04,794 INFO L225 Difference]: With dead ends: 1902 [2019-01-15 11:51:04,794 INFO L226 Difference]: Without dead ends: 1142 [2019-01-15 11:51:04,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-01-15 11:51:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 774. [2019-01-15 11:51:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-15 11:51:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1013 transitions. [2019-01-15 11:51:04,880 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1013 transitions. Word has length 103 [2019-01-15 11:51:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 1013 transitions. [2019-01-15 11:51:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1013 transitions. [2019-01-15 11:51:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-15 11:51:04,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:04,885 INFO L402 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-01-15 11:51:04,886 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 923269453, now seen corresponding path program 1 times [2019-01-15 11:51:04,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:04,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-15 11:51:05,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:05,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 11:51:05,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 11:51:05,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 11:51:05,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 11:51:05,106 INFO L87 Difference]: Start difference. First operand 774 states and 1013 transitions. Second operand 3 states. [2019-01-15 11:51:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:05,281 INFO L93 Difference]: Finished difference Result 1546 states and 2028 transitions. [2019-01-15 11:51:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 11:51:05,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-15 11:51:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:05,287 INFO L225 Difference]: With dead ends: 1546 [2019-01-15 11:51:05,287 INFO L226 Difference]: Without dead ends: 778 [2019-01-15 11:51:05,288 INFO L631 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-01-15 11:51:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-01-15 11:51:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2019-01-15 11:51:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-01-15 11:51:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1017 transitions. [2019-01-15 11:51:05,341 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1017 transitions. Word has length 103 [2019-01-15 11:51:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:05,341 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 1017 transitions. [2019-01-15 11:51:05,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 11:51:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1017 transitions. [2019-01-15 11:51:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-15 11:51:05,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:05,344 INFO L402 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-01-15 11:51:05,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:05,345 INFO L82 PathProgramCache]: Analyzing trace with hash 79263951, now seen corresponding path program 1 times [2019-01-15 11:51:05,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:05,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-15 11:51:05,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:05,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:05,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:05,617 INFO L87 Difference]: Start difference. First operand 778 states and 1017 transitions. Second operand 4 states. [2019-01-15 11:51:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:06,078 INFO L93 Difference]: Finished difference Result 3418 states and 4434 transitions. [2019-01-15 11:51:06,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:06,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-15 11:51:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:06,097 INFO L225 Difference]: With dead ends: 3418 [2019-01-15 11:51:06,097 INFO L226 Difference]: Without dead ends: 2646 [2019-01-15 11:51:06,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2019-01-15 11:51:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 786. [2019-01-15 11:51:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-01-15 11:51:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1025 transitions. [2019-01-15 11:51:06,193 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1025 transitions. Word has length 103 [2019-01-15 11:51:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:06,194 INFO L480 AbstractCegarLoop]: Abstraction has 786 states and 1025 transitions. [2019-01-15 11:51:06,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1025 transitions. [2019-01-15 11:51:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-15 11:51:06,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:06,198 INFO L402 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-01-15 11:51:06,198 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1850764468, now seen corresponding path program 1 times [2019-01-15 11:51:06,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-15 11:51:06,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:06,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:06,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:06,413 INFO L87 Difference]: Start difference. First operand 786 states and 1025 transitions. Second operand 4 states. [2019-01-15 11:51:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:06,934 INFO L93 Difference]: Finished difference Result 3666 states and 4781 transitions. [2019-01-15 11:51:06,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:06,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-01-15 11:51:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:06,950 INFO L225 Difference]: With dead ends: 3666 [2019-01-15 11:51:06,950 INFO L226 Difference]: Without dead ends: 2886 [2019-01-15 11:51:06,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-01-15 11:51:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 794. [2019-01-15 11:51:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-01-15 11:51:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1033 transitions. [2019-01-15 11:51:07,061 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1033 transitions. Word has length 104 [2019-01-15 11:51:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:07,061 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1033 transitions. [2019-01-15 11:51:07,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1033 transitions. [2019-01-15 11:51:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-15 11:51:07,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:07,063 INFO L402 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-01-15 11:51:07,063 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 431077116, now seen corresponding path program 1 times [2019-01-15 11:51:07,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:07,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:07,291 INFO L87 Difference]: Start difference. First operand 794 states and 1033 transitions. Second operand 4 states. [2019-01-15 11:51:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:07,693 INFO L93 Difference]: Finished difference Result 3370 states and 4384 transitions. [2019-01-15 11:51:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:07,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-01-15 11:51:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:07,709 INFO L225 Difference]: With dead ends: 3370 [2019-01-15 11:51:07,709 INFO L226 Difference]: Without dead ends: 2582 [2019-01-15 11:51:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-01-15 11:51:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 882. [2019-01-15 11:51:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-01-15 11:51:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1147 transitions. [2019-01-15 11:51:07,897 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1147 transitions. Word has length 104 [2019-01-15 11:51:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:07,897 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1147 transitions. [2019-01-15 11:51:07,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1147 transitions. [2019-01-15 11:51:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-15 11:51:07,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:07,899 INFO L402 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-01-15 11:51:07,899 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -98837862, now seen corresponding path program 1 times [2019-01-15 11:51:07,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:07,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-15 11:51:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-15 11:51:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-15 11:51:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-15 11:51:08,547 INFO L87 Difference]: Start difference. First operand 882 states and 1147 transitions. Second operand 6 states. [2019-01-15 11:51:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:09,313 INFO L93 Difference]: Finished difference Result 3140 states and 4108 transitions. [2019-01-15 11:51:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-15 11:51:09,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-01-15 11:51:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:09,325 INFO L225 Difference]: With dead ends: 3140 [2019-01-15 11:51:09,325 INFO L226 Difference]: Without dead ends: 2264 [2019-01-15 11:51:09,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-15 11:51:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-01-15 11:51:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 914. [2019-01-15 11:51:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-01-15 11:51:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1179 transitions. [2019-01-15 11:51:09,472 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1179 transitions. Word has length 105 [2019-01-15 11:51:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:09,472 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1179 transitions. [2019-01-15 11:51:09,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-15 11:51:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1179 transitions. [2019-01-15 11:51:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-15 11:51:09,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:09,474 INFO L402 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-01-15 11:51:09,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2138009594, now seen corresponding path program 1 times [2019-01-15 11:51:09,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:09,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:09,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:09,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:09,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:09,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-15 11:51:09,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-15 11:51:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:09,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-15 11:51:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-15 11:51:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-15 11:51:10,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 11:51:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 11:51:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:10,104 INFO L87 Difference]: Start difference. First operand 914 states and 1179 transitions. Second operand 5 states. [2019-01-15 11:51:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:11,171 INFO L93 Difference]: Finished difference Result 3066 states and 3938 transitions. [2019-01-15 11:51:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:51:11,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-01-15 11:51:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:11,183 INFO L225 Difference]: With dead ends: 3066 [2019-01-15 11:51:11,183 INFO L226 Difference]: Without dead ends: 2158 [2019-01-15 11:51:11,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-01-15 11:51:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1150. [2019-01-15 11:51:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-01-15 11:51:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1471 transitions. [2019-01-15 11:51:11,385 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1471 transitions. Word has length 106 [2019-01-15 11:51:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:11,386 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1471 transitions. [2019-01-15 11:51:11,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 11:51:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1471 transitions. [2019-01-15 11:51:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-15 11:51:11,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:11,390 INFO L402 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-01-15 11:51:11,390 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1204149741, now seen corresponding path program 1 times [2019-01-15 11:51:11,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 11:51:11,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 11:51:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 11:51:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 11:51:11,592 INFO L87 Difference]: Start difference. First operand 1150 states and 1471 transitions. Second operand 3 states. [2019-01-15 11:51:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:11,988 INFO L93 Difference]: Finished difference Result 2515 states and 3220 transitions. [2019-01-15 11:51:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 11:51:11,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-01-15 11:51:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:11,992 INFO L225 Difference]: With dead ends: 2515 [2019-01-15 11:51:11,992 INFO L226 Difference]: Without dead ends: 817 [2019-01-15 11:51:11,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-15 11:51:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-01-15 11:51:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 801. [2019-01-15 11:51:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-01-15 11:51:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1010 transitions. [2019-01-15 11:51:12,128 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1010 transitions. Word has length 113 [2019-01-15 11:51:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:12,129 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1010 transitions. [2019-01-15 11:51:12,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 11:51:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1010 transitions. [2019-01-15 11:51:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-15 11:51:12,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:12,131 INFO L402 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-01-15 11:51:12,131 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1369132351, now seen corresponding path program 1 times [2019-01-15 11:51:12,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-15 11:51:12,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:12,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:12,333 INFO L87 Difference]: Start difference. First operand 801 states and 1010 transitions. Second operand 4 states. [2019-01-15 11:51:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:12,633 INFO L93 Difference]: Finished difference Result 2367 states and 3000 transitions. [2019-01-15 11:51:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:51:12,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-15 11:51:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:12,639 INFO L225 Difference]: With dead ends: 2367 [2019-01-15 11:51:12,639 INFO L226 Difference]: Without dead ends: 1572 [2019-01-15 11:51:12,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-01-15 11:51:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 707. [2019-01-15 11:51:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-01-15 11:51:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 894 transitions. [2019-01-15 11:51:12,760 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 894 transitions. Word has length 115 [2019-01-15 11:51:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:12,760 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 894 transitions. [2019-01-15 11:51:12,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 894 transitions. [2019-01-15 11:51:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-15 11:51:12,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:12,762 INFO L402 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-01-15 11:51:12,762 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1210358878, now seen corresponding path program 1 times [2019-01-15 11:51:12,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:13,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:13,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:13,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:13,019 INFO L87 Difference]: Start difference. First operand 707 states and 894 transitions. Second operand 4 states. [2019-01-15 11:51:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:13,538 INFO L93 Difference]: Finished difference Result 952 states and 1205 transitions. [2019-01-15 11:51:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:51:13,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-15 11:51:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:13,541 INFO L225 Difference]: With dead ends: 952 [2019-01-15 11:51:13,541 INFO L226 Difference]: Without dead ends: 450 [2019-01-15 11:51:13,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-01-15 11:51:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 410. [2019-01-15 11:51:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-01-15 11:51:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 519 transitions. [2019-01-15 11:51:13,671 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 519 transitions. Word has length 124 [2019-01-15 11:51:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:13,671 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 519 transitions. [2019-01-15 11:51:13,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 519 transitions. [2019-01-15 11:51:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-15 11:51:13,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:13,673 INFO L402 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-01-15 11:51:13,674 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1549883475, now seen corresponding path program 1 times [2019-01-15 11:51:13,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:13,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:13,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 11:51:13,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 11:51:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 11:51:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 11:51:13,866 INFO L87 Difference]: Start difference. First operand 410 states and 519 transitions. Second operand 4 states. [2019-01-15 11:51:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:13,960 INFO L93 Difference]: Finished difference Result 642 states and 811 transitions. [2019-01-15 11:51:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 11:51:13,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-01-15 11:51:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:13,963 INFO L225 Difference]: With dead ends: 642 [2019-01-15 11:51:13,963 INFO L226 Difference]: Without dead ends: 452 [2019-01-15 11:51:13,964 INFO L631 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-01-15 11:51:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-01-15 11:51:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 412. [2019-01-15 11:51:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-15 11:51:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 521 transitions. [2019-01-15 11:51:14,038 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 521 transitions. Word has length 166 [2019-01-15 11:51:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:14,038 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 521 transitions. [2019-01-15 11:51:14,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 11:51:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 521 transitions. [2019-01-15 11:51:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-15 11:51:14,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:14,040 INFO L402 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-01-15 11:51:14,041 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1716627662, now seen corresponding path program 1 times [2019-01-15 11:51:14,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 11:51:14,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:14,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 11:51:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 11:51:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 11:51:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 11:51:14,445 INFO L87 Difference]: Start difference. First operand 412 states and 521 transitions. Second operand 5 states. [2019-01-15 11:51:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:14,912 INFO L93 Difference]: Finished difference Result 604 states and 764 transitions. [2019-01-15 11:51:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 11:51:14,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-01-15 11:51:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:14,916 INFO L225 Difference]: With dead ends: 604 [2019-01-15 11:51:14,916 INFO L226 Difference]: Without dead ends: 411 [2019-01-15 11:51:14,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 11:51:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-01-15 11:51:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2019-01-15 11:51:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-01-15 11:51:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 516 transitions. [2019-01-15 11:51:15,024 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 516 transitions. Word has length 167 [2019-01-15 11:51:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:15,024 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 516 transitions. [2019-01-15 11:51:15,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 11:51:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 516 transitions. [2019-01-15 11:51:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-15 11:51:15,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:15,028 INFO L402 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-01-15 11:51:15,028 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1594428674, now seen corresponding path program 1 times [2019-01-15 11:51:15,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:15,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:15,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-15 11:51:15,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 11:51:15,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-15 11:51:15,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-15 11:51:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-15 11:51:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-15 11:51:15,498 INFO L87 Difference]: Start difference. First operand 409 states and 516 transitions. Second operand 6 states. [2019-01-15 11:51:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:15,945 INFO L93 Difference]: Finished difference Result 1660 states and 2120 transitions. [2019-01-15 11:51:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-15 11:51:15,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-01-15 11:51:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:15,950 INFO L225 Difference]: With dead ends: 1660 [2019-01-15 11:51:15,950 INFO L226 Difference]: Without dead ends: 1257 [2019-01-15 11:51:15,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-15 11:51:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-01-15 11:51:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 413. [2019-01-15 11:51:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-01-15 11:51:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 520 transitions. [2019-01-15 11:51:16,020 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 520 transitions. Word has length 175 [2019-01-15 11:51:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:16,020 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 520 transitions. [2019-01-15 11:51:16,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-15 11:51:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 520 transitions. [2019-01-15 11:51:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-15 11:51:16,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 11:51:16,022 INFO L402 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-01-15 11:51:16,023 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 11:51:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 11:51:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 329420158, now seen corresponding path program 1 times [2019-01-15 11:51:16,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 11:51:16,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 11:51:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:16,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 11:51:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 11:51:17,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-15 11:51:17,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-15 11:51:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 11:51:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 11:51:17,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-15 11:51:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 11:51:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-15 11:51:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-15 11:51:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-15 11:51:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-15 11:51:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-15 11:51:17,771 INFO L87 Difference]: Start difference. First operand 413 states and 520 transitions. Second operand 12 states. [2019-01-15 11:51:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 11:51:17,910 INFO L93 Difference]: Finished difference Result 413 states and 520 transitions. [2019-01-15 11:51:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 11:51:17,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 181 [2019-01-15 11:51:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 11:51:17,911 INFO L225 Difference]: With dead ends: 413 [2019-01-15 11:51:17,911 INFO L226 Difference]: Without dead ends: 0 [2019-01-15 11:51:17,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-15 11:51:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-15 11:51:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-15 11:51:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-15 11:51:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-15 11:51:17,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2019-01-15 11:51:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 11:51:17,913 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-15 11:51:17,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-15 11:51:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-15 11:51:17,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-15 11:51:17,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-15 11:51:18,143 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 99 [2019-01-15 11:51:18,290 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2019-01-15 11:51:18,429 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:18,553 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:18,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:18,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:18,684 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 86 [2019-01-15 11:51:18,791 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:18,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:18,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,250 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 109 [2019-01-15 11:51:19,369 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:19,494 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:19,680 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:19,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:19,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,059 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 108 [2019-01-15 11:51:20,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,352 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:20,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,588 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:20,726 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:20,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:20,856 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 119 [2019-01-15 11:51:21,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:21,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:21,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:21,563 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:21,929 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 132 [2019-01-15 11:51:22,062 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:22,199 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-01-15 11:51:22,477 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2019-01-15 11:51:22,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:22,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,181 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 112 [2019-01-15 11:51:23,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,629 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 117 [2019-01-15 11:51:23,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:23,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:24,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:24,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:24,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:24,863 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 99 [2019-01-15 11:51:24,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,332 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 116 [2019-01-15 11:51:25,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:25,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,489 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 83 [2019-01-15 11:51:26,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:26,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 11:51:27,263 WARN L181 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:27,611 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:27,851 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:28,062 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:28,285 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 21 [2019-01-15 11:51:28,495 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:28,850 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 21 [2019-01-15 11:51:29,147 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:29,375 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:29,707 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:30,027 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 21 [2019-01-15 11:51:30,155 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 21 [2019-01-15 11:51:30,383 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 26 [2019-01-15 11:51:30,668 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:30,847 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2019-01-15 11:51:31,132 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:31,419 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:31,872 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 27 [2019-01-15 11:51:32,082 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:32,290 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:32,652 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:32,861 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:33,128 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:33,300 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:33,571 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:33,848 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:34,200 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 21 [2019-01-15 11:51:34,530 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:34,865 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:35,158 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:35,369 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:35,645 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:35,909 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:36,180 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:36,453 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:36,660 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:36,858 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 21 [2019-01-15 11:51:37,028 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:37,238 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:37,720 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 27 [2019-01-15 11:51:37,937 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-01-15 11:51:38,185 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:38,511 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 21 [2019-01-15 11:51:38,715 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:38,910 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-01-15 11:51:39,189 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:39,531 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 31 [2019-01-15 11:51:39,794 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2019-01-15 11:51:40,268 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 21 [2019-01-15 11:51:40,544 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:40,752 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:40,868 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-01-15 11:51:41,222 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:41,452 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 23 [2019-01-15 11:51:41,731 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:41,845 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-01-15 11:51:42,060 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 21 [2019-01-15 11:51:42,325 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 29 [2019-01-15 11:51:42,544 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-01-15 11:51:42,806 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 26 [2019-01-15 11:51:43,085 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:43,371 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:43,599 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:43,808 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-01-15 11:51:44,120 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:44,435 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:44,775 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:45,131 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:45,436 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:45,631 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-01-15 11:51:45,911 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:46,031 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-01-15 11:51:46,241 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:46,453 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:46,570 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-01-15 11:51:46,776 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:47,237 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 21 [2019-01-15 11:51:47,376 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 21 [2019-01-15 11:51:47,659 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:48,238 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 26 [2019-01-15 11:51:48,523 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:48,798 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 29 [2019-01-15 11:51:49,075 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:49,357 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:49,634 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:49,913 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:50,293 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:50,513 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:50,788 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:51,070 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:51,324 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 21 [2019-01-15 11:51:51,494 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:51,703 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:51,916 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 21 [2019-01-15 11:51:52,282 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 21 [2019-01-15 11:51:52,453 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2019-01-15 11:51:52,459 INFO L444 ceAbstractionStarter]: At program point L1852(lines 1826 1854) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,459 INFO L448 ceAbstractionStarter]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2019-01-15 11:51:52,460 INFO L444 ceAbstractionStarter]: At program point L1952(lines 1937 1958) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (and .cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and .cse0 .cse2) (and (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0))))) [2019-01-15 11:51:52,460 INFO L448 ceAbstractionStarter]: For program point L1622(lines 1622 1628) no Hoare annotation was computed. [2019-01-15 11:51:52,460 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 1622 1628) no Hoare annotation was computed. [2019-01-15 11:51:52,460 INFO L444 ceAbstractionStarter]: At program point L1556(lines 1553 1558) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,460 INFO L448 ceAbstractionStarter]: For program point L1622-2(lines 1622 1628) no Hoare annotation was computed. [2019-01-15 11:51:52,460 INFO L444 ceAbstractionStarter]: At program point L2547-1(lines 2546 2548) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L2547(lines 2546 2548) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L2547-2(lines 2546 2548) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L2349(lines 2321 2361) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,461 INFO L448 ceAbstractionStarter]: For program point L2019(lines 2019 2022) no Hoare annotation was computed. [2019-01-15 11:51:52,461 INFO L448 ceAbstractionStarter]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L1722(lines 1704 1724) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L2581(lines 2580 2582) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L2482(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))))) [2019-01-15 11:51:52,461 INFO L448 ceAbstractionStarter]: For program point L1987(lines 1987 1992) no Hoare annotation was computed. [2019-01-15 11:51:52,461 INFO L444 ceAbstractionStarter]: At program point L1954(lines 1937 1958) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (and .cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and .cse0 .cse2) (and (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0))))) [2019-01-15 11:51:52,462 INFO L444 ceAbstractionStarter]: At program point L2450(lines 2446 2452) the Hoare annotation is: (let ((.cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~ldv_count_2~0 0) (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0) (<= 7 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse2 .cse1))) [2019-01-15 11:51:52,465 INFO L444 ceAbstractionStarter]: At program point L2384(lines 2379 2386) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L1691(lines 1691 1694) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L1691-1(lines 1691 1694) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L1691-2(lines 1691 1694) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L2352(lines 2352 2355) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L2253(lines 2253 2257) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L2253-2(lines 2253 2257) no Hoare annotation was computed. [2019-01-15 11:51:52,465 INFO L448 ceAbstractionStarter]: For program point L2055(lines 2055 2058) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L444 ceAbstractionStarter]: At program point L1692(lines 1682 1702) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,466 INFO L444 ceAbstractionStarter]: At program point L1692-1(lines 1682 1702) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,466 INFO L444 ceAbstractionStarter]: At program point L1692-2(lines 1682 1702) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-2(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L444 ceAbstractionStarter]: At program point L2551(lines 2550 2552) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-1(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-4(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-3(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-5(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,466 INFO L448 ceAbstractionStarter]: For program point L2584-8(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,467 INFO L444 ceAbstractionStarter]: At program point L2353(lines 2321 2361) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,467 INFO L448 ceAbstractionStarter]: For program point L2584-7(lines 2584 2586) no Hoare annotation was computed. [2019-01-15 11:51:52,467 INFO L451 ceAbstractionStarter]: At program point L2584-9(lines 1 2586) the Hoare annotation is: true [2019-01-15 11:51:52,467 INFO L444 ceAbstractionStarter]: At program point L1957(lines 1932 1959) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0 2))) (let ((.cse0 (and .cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1 .cse2) (and .cse0 .cse2) (and (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0))))) [2019-01-15 11:51:52,467 INFO L444 ceAbstractionStarter]: At program point L1627(lines 1620 1629) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-01-15 11:51:52,467 INFO L444 ceAbstractionStarter]: At program point L1627-1(lines 1620 1629) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,467 INFO L444 ceAbstractionStarter]: At program point L1627-2(lines 1620 1629) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse3 (<= 6 ~ldv_count_1~0)) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse4 (= ~ldv_count_2~0 0))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse2 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse3 .cse0 .cse4))) [2019-01-15 11:51:52,467 INFO L448 ceAbstractionStarter]: For program point L2156(lines 2156 2161) no Hoare annotation was computed. [2019-01-15 11:51:52,468 INFO L448 ceAbstractionStarter]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2019-01-15 11:51:52,468 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2095) no Hoare annotation was computed. [2019-01-15 11:51:52,468 INFO L448 ceAbstractionStarter]: For program point L2125(lines 2125 2129) no Hoare annotation was computed. [2019-01-15 11:51:52,468 INFO L444 ceAbstractionStarter]: At program point L1993(lines 1960 1995) the Hoare annotation is: (let ((.cse2 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse3 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse1 (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0)) (.cse4 (<= 6 ~ldv_count_1~0)) (.cse5 (= ~ldv_count_2~0 0))) (or (and .cse0 .cse1 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse2) (and .cse2 .cse3) (and .cse4 .cse2 .cse5) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse3) (and .cse0 .cse1 (and .cse4 .cse5) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)))) [2019-01-15 11:51:52,468 INFO L444 ceAbstractionStarter]: At program point L1564(lines 1559 1566) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,468 INFO L444 ceAbstractionStarter]: At program point L2522(lines 2521 2523) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,468 INFO L451 ceAbstractionStarter]: At program point L2555(lines 2554 2556) the Hoare annotation is: true [2019-01-15 11:51:52,468 INFO L451 ceAbstractionStarter]: At program point L2522-2(lines 2521 2523) the Hoare annotation is: true [2019-01-15 11:51:52,469 INFO L444 ceAbstractionStarter]: At program point L2522-1(lines 2521 2523) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2258(lines 2258 2265) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2258-2(lines 2258 2265) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L444 ceAbstractionStarter]: At program point L2060(lines 2008 2113) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse3 (<= 6 ~ldv_count_1~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse4 (= ~ldv_count_2~0 0))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and .cse2 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse2 (and .cse3 .cse4) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse3 .cse1 .cse4))) [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2030) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L444 ceAbstractionStarter]: At program point L1598(lines 1592 1600) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2457-1(lines 2457 2465) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2457(lines 2457 2465) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2457-3(lines 2457 2465) no Hoare annotation was computed. [2019-01-15 11:51:52,469 INFO L448 ceAbstractionStarter]: For program point L2457-2(lines 2457 2465) no Hoare annotation was computed. [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L1929(lines 1916 1931) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1 0))) (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (and .cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))))) (or (and .cse0 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse0 (<= 6 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0) (= ~ldv_count_2~0 0)) (and .cse2 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse2)))) [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L1665(lines 1660 1667) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L1632(lines 1630 1633) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1))) [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L1632-1(lines 1630 1633) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L1632-2(lines 1630 1633) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse3 (<= 6 ~ldv_count_1~0)) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse4 (= ~ldv_count_2~0 0))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse2 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse3 .cse0 .cse4))) [2019-01-15 11:51:52,470 INFO L444 ceAbstractionStarter]: At program point L2392(lines 2387 2394) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,470 INFO L448 ceAbstractionStarter]: For program point L2326(lines 2326 2329) no Hoare annotation was computed. [2019-01-15 11:51:52,470 INFO L448 ceAbstractionStarter]: For program point L2194(lines 2194 2197) no Hoare annotation was computed. [2019-01-15 11:51:52,471 INFO L448 ceAbstractionStarter]: For program point L2194-1(lines 2194 2197) no Hoare annotation was computed. [2019-01-15 11:51:52,471 INFO L444 ceAbstractionStarter]: At program point L2062(lines 2008 2113) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse1 (<= 6 ~ldv_count_1~0)) (.cse3 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse2 (= ~ldv_count_2~0 0)) (.cse4 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and .cse0 (and .cse1 .cse2) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse0 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse3) (and .cse3 .cse4) (and .cse1 .cse3 .cse2) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse4))) [2019-01-15 11:51:52,471 INFO L448 ceAbstractionStarter]: For program point L1732(line 1732) no Hoare annotation was computed. [2019-01-15 11:51:52,471 INFO L448 ceAbstractionStarter]: For program point L1732-2(lines 1732 1735) no Hoare annotation was computed. [2019-01-15 11:51:52,471 INFO L444 ceAbstractionStarter]: At program point L2525-1(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,471 INFO L444 ceAbstractionStarter]: At program point L2525(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,471 INFO L444 ceAbstractionStarter]: At program point L2525-3(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,471 INFO L444 ceAbstractionStarter]: At program point L2525-2(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0))) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,472 INFO L444 ceAbstractionStarter]: At program point L2525-5(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,472 INFO L451 ceAbstractionStarter]: At program point L2360(lines 2311 2362) the Hoare annotation is: true [2019-01-15 11:51:52,472 INFO L444 ceAbstractionStarter]: At program point L2525-4(lines 2524 2526) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,472 INFO L451 ceAbstractionStarter]: At program point L2525-7(lines 2524 2526) the Hoare annotation is: true [2019-01-15 11:51:52,472 INFO L451 ceAbstractionStarter]: At program point L2525-6(lines 2524 2526) the Hoare annotation is: true [2019-01-15 11:51:52,472 INFO L451 ceAbstractionStarter]: At program point L2525-8(lines 2524 2526) the Hoare annotation is: true [2019-01-15 11:51:52,472 INFO L444 ceAbstractionStarter]: At program point L2559-1(lines 2558 2560) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,472 INFO L444 ceAbstractionStarter]: At program point L2559(lines 2558 2560) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,472 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2463) no Hoare annotation was computed. [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L2559-2(lines 2558 2560) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,473 INFO L448 ceAbstractionStarter]: For program point L2460-2(lines 2460 2463) no Hoare annotation was computed. [2019-01-15 11:51:52,473 INFO L448 ceAbstractionStarter]: For program point L2229(lines 2229 2232) no Hoare annotation was computed. [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L1701(lines 1679 1703) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L1701-1(lines 1679 1703) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L1701-2(lines 1679 1703) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L2494(lines 1 2586) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2019-01-15 11:51:52,473 INFO L444 ceAbstractionStarter]: At program point L2098(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0))) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,474 INFO L444 ceAbstractionStarter]: At program point L2065(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,475 INFO L448 ceAbstractionStarter]: For program point L2032(lines 2032 2049) no Hoare annotation was computed. [2019-01-15 11:51:52,475 INFO L448 ceAbstractionStarter]: For program point L2165(lines 2165 2170) no Hoare annotation was computed. [2019-01-15 11:51:52,475 INFO L444 ceAbstractionStarter]: At program point L1736(lines 1725 1738) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,475 INFO L444 ceAbstractionStarter]: At program point L2529(lines 2528 2530) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,475 INFO L451 ceAbstractionStarter]: At program point L2298(lines 2286 2304) the Hoare annotation is: true [2019-01-15 11:51:52,475 INFO L444 ceAbstractionStarter]: At program point L2100(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0))) (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,475 INFO L444 ceAbstractionStarter]: At program point L2067(lines 2008 2113) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,476 INFO L444 ceAbstractionStarter]: At program point L1572(lines 1567 1574) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-15 11:51:52,481 INFO L444 ceAbstractionStarter]: At program point L2200(lines 2185 2220) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,481 INFO L451 ceAbstractionStarter]: At program point L2200-1(lines 2185 2220) the Hoare annotation is: true [2019-01-15 11:51:52,481 INFO L448 ceAbstractionStarter]: For program point L2068(lines 2068 2071) no Hoare annotation was computed. [2019-01-15 11:51:52,481 INFO L448 ceAbstractionStarter]: For program point L1969(lines 1969 1972) no Hoare annotation was computed. [2019-01-15 11:51:52,481 INFO L444 ceAbstractionStarter]: At program point L1639(lines 1634 1641) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,482 INFO L444 ceAbstractionStarter]: At program point L1639-1(lines 1634 1641) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,482 INFO L444 ceAbstractionStarter]: At program point L1639-2(lines 1634 1641) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse2 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse3 (<= 6 ~ldv_count_1~0)) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse4 (= ~ldv_count_2~0 0))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and .cse2 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse3 .cse0 .cse4))) [2019-01-15 11:51:52,482 INFO L444 ceAbstractionStarter]: At program point L2498(lines 2497 2499) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,482 INFO L448 ceAbstractionStarter]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,482 INFO L448 ceAbstractionStarter]: For program point L2399(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,482 INFO L451 ceAbstractionStarter]: At program point L2300(lines 2286 2304) the Hoare annotation is: true [2019-01-15 11:51:52,482 INFO L448 ceAbstractionStarter]: For program point L2399-2(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,482 INFO L448 ceAbstractionStarter]: For program point L2333(lines 2333 2348) no Hoare annotation was computed. [2019-01-15 11:51:52,482 INFO L444 ceAbstractionStarter]: At program point L2168(lines 2122 2179) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,483 INFO L444 ceAbstractionStarter]: At program point L2102(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0))) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,486 INFO L444 ceAbstractionStarter]: At program point L2069(lines 2008 2113) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,486 INFO L448 ceAbstractionStarter]: For program point L1904(lines 1904 1907) no Hoare annotation was computed. [2019-01-15 11:51:52,486 INFO L444 ceAbstractionStarter]: At program point L2532(lines 2531 2533) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,486 INFO L444 ceAbstractionStarter]: At program point L2565-1(lines 2564 2566) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,486 INFO L444 ceAbstractionStarter]: At program point L2565(lines 2564 2566) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,486 INFO L444 ceAbstractionStarter]: At program point L2466(lines 2454 2468) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,487 INFO L451 ceAbstractionStarter]: At program point L2565-3(lines 2564 2566) the Hoare annotation is: true [2019-01-15 11:51:52,487 INFO L451 ceAbstractionStarter]: At program point L2532-2(lines 2531 2533) the Hoare annotation is: true [2019-01-15 11:51:52,487 INFO L444 ceAbstractionStarter]: At program point L2532-1(lines 2531 2533) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,487 INFO L444 ceAbstractionStarter]: At program point L2565-2(lines 2564 2566) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,487 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,487 INFO L444 ceAbstractionStarter]: At program point L2466-1(lines 2454 2468) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,487 INFO L448 ceAbstractionStarter]: For program point L2334(line 2334) no Hoare annotation was computed. [2019-01-15 11:51:52,487 INFO L444 ceAbstractionStarter]: At program point L2202(lines 2185 2220) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,488 INFO L451 ceAbstractionStarter]: At program point L2202-1(lines 2185 2220) the Hoare annotation is: true [2019-01-15 11:51:52,488 INFO L448 ceAbstractionStarter]: For program point L1938(lines 1938 1941) no Hoare annotation was computed. [2019-01-15 11:51:52,490 INFO L444 ceAbstractionStarter]: At program point L2368(lines 2363 2370) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,490 INFO L448 ceAbstractionStarter]: For program point L2137(lines 2137 2142) no Hoare annotation was computed. [2019-01-15 11:51:52,490 INFO L448 ceAbstractionStarter]: For program point L1840(lines 1840 1843) no Hoare annotation was computed. [2019-01-15 11:51:52,490 INFO L444 ceAbstractionStarter]: At program point L2501(lines 2500 2502) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,490 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,490 INFO L451 ceAbstractionStarter]: At program point L2303(lines 2561 2563) the Hoare annotation is: true [2019-01-15 11:51:52,491 INFO L444 ceAbstractionStarter]: At program point L2204(lines 2185 2220) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,491 INFO L451 ceAbstractionStarter]: At program point L2204-1(lines 2185 2220) the Hoare annotation is: true [2019-01-15 11:51:52,491 INFO L448 ceAbstractionStarter]: For program point L1973(lines 1973 1979) no Hoare annotation was computed. [2019-01-15 11:51:52,491 INFO L444 ceAbstractionStarter]: At program point L2568(lines 2567 2569) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,491 INFO L451 ceAbstractionStarter]: At program point L2568-1(lines 2567 2569) the Hoare annotation is: true [2019-01-15 11:51:52,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2399) no Hoare annotation was computed. [2019-01-15 11:51:52,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-15 11:51:52,491 INFO L444 ceAbstractionStarter]: At program point L2106(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,491 INFO L448 ceAbstractionStarter]: For program point L2073(lines 2073 2076) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L444 ceAbstractionStarter]: At program point L2536(lines 2535 2537) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L2338(line 2338) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L2107(lines 2107 2110) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L2041(lines 2041 2048) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L2041-1(lines 2032 2049) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L1909(lines 1909 1912) no Hoare annotation was computed. [2019-01-15 11:51:52,492 INFO L444 ceAbstractionStarter]: At program point L2504(lines 2503 2505) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,492 INFO L444 ceAbstractionStarter]: At program point L2174(lines 2122 2179) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,492 INFO L444 ceAbstractionStarter]: At program point L2108(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,492 INFO L448 ceAbstractionStarter]: For program point L1976(lines 1976 1979) no Hoare annotation was computed. [2019-01-15 11:51:52,493 INFO L448 ceAbstractionStarter]: For program point L1976-2(lines 1973 1979) no Hoare annotation was computed. [2019-01-15 11:51:52,493 INFO L448 ceAbstractionStarter]: For program point L1712(line 1712) no Hoare annotation was computed. [2019-01-15 11:51:52,493 INFO L448 ceAbstractionStarter]: For program point L1712-2(lines 1712 1715) no Hoare annotation was computed. [2019-01-15 11:51:52,494 INFO L444 ceAbstractionStarter]: At program point L2208(lines 2185 2220) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,494 INFO L451 ceAbstractionStarter]: At program point L2208-1(lines 2185 2220) the Hoare annotation is: true [2019-01-15 11:51:52,494 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-15 11:51:52,494 INFO L444 ceAbstractionStarter]: At program point L1647(lines 1642 1649) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,494 INFO L444 ceAbstractionStarter]: At program point L1647-1(lines 1642 1649) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,494 INFO L448 ceAbstractionStarter]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2019-01-15 11:51:52,494 INFO L448 ceAbstractionStarter]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2019-01-15 11:51:52,494 INFO L444 ceAbstractionStarter]: At program point L2176(lines 2122 2179) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,494 INFO L448 ceAbstractionStarter]: For program point L2209-1(lines 2209 2212) no Hoare annotation was computed. [2019-01-15 11:51:52,495 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2212) no Hoare annotation was computed. [2019-01-15 11:51:52,495 INFO L448 ceAbstractionStarter]: For program point L1747(line 1747) no Hoare annotation was computed. [2019-01-15 11:51:52,495 INFO L448 ceAbstractionStarter]: For program point L1747-2(lines 1747 1750) no Hoare annotation was computed. [2019-01-15 11:51:52,495 INFO L444 ceAbstractionStarter]: At program point L2540(lines 2539 2541) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,495 INFO L451 ceAbstractionStarter]: At program point L2540-2(lines 2539 2541) the Hoare annotation is: true [2019-01-15 11:51:52,495 INFO L444 ceAbstractionStarter]: At program point L2540-1(lines 2539 2541) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,495 INFO L448 ceAbstractionStarter]: For program point L2342(line 2342) no Hoare annotation was computed. [2019-01-15 11:51:52,495 INFO L444 ceAbstractionStarter]: At program point L2276(lines 2271 2278) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) [2019-01-15 11:51:52,495 INFO L444 ceAbstractionStarter]: At program point L2210(lines 2185 2220) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,495 INFO L451 ceAbstractionStarter]: At program point L2210-1(lines 2185 2220) the Hoare annotation is: true [2019-01-15 11:51:52,496 INFO L448 ceAbstractionStarter]: For program point L2078(lines 2078 2081) no Hoare annotation was computed. [2019-01-15 11:51:52,496 INFO L448 ceAbstractionStarter]: For program point L2012(lines 2012 2015) no Hoare annotation was computed. [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L1913(lines 1900 1915) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= 6 ~ldv_count_1~0) (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0) (= ~ldv_count_2~0 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L1847(lines 1833 1853) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L1583(lines 1579 1585) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L2376(lines 2371 2378) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))))) [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L2112(lines 1996 2114) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,496 INFO L444 ceAbstractionStarter]: At program point L2079(lines 2008 2113) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ |ULTIMATE.start_create_sensor_#res| 12) 0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (<= (+ ULTIMATE.start_ibmpex_find_sensors_~err~3 12) 0)) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L1947(lines 1947 1950) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2251) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L444 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,497 INFO L444 ceAbstractionStarter]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L444 ceAbstractionStarter]: At program point L1849(lines 1833 1853) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L1684(lines 1684 1687) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L1684-1(lines 1684 1687) no Hoare annotation was computed. [2019-01-15 11:51:52,497 INFO L448 ceAbstractionStarter]: For program point L1684-2(lines 1684 1687) no Hoare annotation was computed. [2019-01-15 11:51:52,498 INFO L444 ceAbstractionStarter]: At program point L2543-1(lines 2542 2544) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,498 INFO L444 ceAbstractionStarter]: At program point L2411-1(lines 2408 2413) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,498 INFO L444 ceAbstractionStarter]: At program point L2411(lines 2408 2413) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L2411-3(lines 2408 2413) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ibmpex_find_sensors_~j~0 0)) (.cse2 (<= 6 ~ldv_count_1~0)) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse3 (= ~ldv_count_2~0 0)) (.cse4 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and .cse0 (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse0 .cse2 .cse3 (= ULTIMATE.start_ibmpex_find_sensors_~err~3 0)) (and .cse1 .cse4) (and .cse2 .cse1 .cse3) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse4))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L2411-2(lines 2408 2413) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L1751(lines 1739 1753) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L1685(lines 1682 1702) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L1685-1(lines 1682 1702) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L1685-2(lines 1682 1702) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,499 INFO L444 ceAbstractionStarter]: At program point L2577-1(lines 2576 2578) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and .cse1 .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,500 INFO L444 ceAbstractionStarter]: At program point L2577(lines 2576 2578) the Hoare annotation is: (let ((.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse0) (and .cse0 .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse1) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,505 INFO L444 ceAbstractionStarter]: At program point L2577-2(lines 2576 2578) the Hoare annotation is: (let ((.cse1 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute_2~0))) (.cse0 (not (= 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (or (and .cse0 .cse1) (and (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0) .cse1) (and (<= ~ldv_count_2~0 ~ldv_count_1~0) .cse0) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)))) [2019-01-15 11:51:52,505 INFO L448 ceAbstractionStarter]: For program point L2346(line 2346) no Hoare annotation was computed. [2019-01-15 11:51:52,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 11:51:52 BoogieIcfgContainer [2019-01-15 11:51:52,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-15 11:51:52,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-15 11:51:52,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-15 11:51:52,617 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-15 11:51:52,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 11:50:58" (3/4) ... [2019-01-15 11:51:52,624 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-15 11:51:52,656 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 148 nodes and edges [2019-01-15 11:51:52,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-01-15 11:51:52,662 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-15 11:51:52,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-15 11:51:52,668 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-15 11:51:52,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,726 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,728 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,728 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) [2019-01-15 11:51:52,730 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((j == 0 && \result + 12 <= 0) && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((j == 0 && \result + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0) && err == 0) [2019-01-15 11:51:52,900 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-15 11:51:52,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-15 11:51:52,901 INFO L168 Benchmark]: Toolchain (without parser) took 59370.02 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,903 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 11:51:52,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1306.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 239.51 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,906 INFO L168 Benchmark]: Boogie Preprocessor took 210.01 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,907 INFO L168 Benchmark]: RCFGBuilder took 3273.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,907 INFO L168 Benchmark]: TraceAbstraction took 54050.79 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 914.1 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,908 INFO L168 Benchmark]: Witness Printer took 283.50 ms. Allocated memory is still 2.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-01-15 11:51:52,913 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1306.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 239.51 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 210.01 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3273.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54050.79 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 914.1 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 283.50 ms. Allocated memory is still 2.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2399]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2399]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2399]: 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: 2122]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2558]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2561]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1704]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2122]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: ((((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (((j == 0 && 6 <= ldv_count_1) && ldv_count_2 == 0) && err == 0)) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1642]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2311]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2321]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: ((((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || ((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || ((j == 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err == 0)) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2546]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2546]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2535]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2546]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1642]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2521]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2521]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2363]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1996]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1559]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2576]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2576]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2521]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2576]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((((j == 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err == 0) || ((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: ((((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (((j == 0 && 6 <= ldv_count_1) && ldv_count_2 == 0) && err == 0)) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0) - InvariantResult [Line: 1567]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1739]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1937]: Loop Invariant Derived loop invariant: (((ldv_count_2 <= ldv_count_1 && sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || ((ldv_count_2 + 1 <= ldv_count_1 && sensor_type == 2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((6 <= ldv_count_1 && sensor_type == 2) && ldv_count_2 == 0) && err == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: 1960]: Loop Invariant Derived loop invariant: ((((((j == 0 && \result + 12 <= 0) && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((j == 0 && \result + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0) && err == 0) - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((ldv_count_2 == 0 && j == 0) && 7 <= ldv_count_1) && err == 0)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1579]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1679]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1679]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((6 <= ldv_count_1 && err == 0) && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1833]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2387]: Loop Invariant Derived loop invariant: (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: ((((\result + 12 <= 0 && err + 12 <= 0) && 6 <= ldv_count_1 && ldv_count_2 == 0) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2408]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: ((((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (((j == 0 && 6 <= ldv_count_1) && ldv_count_2 == 0) && err == 0)) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0) - InvariantResult [Line: 2567]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2408]: Loop Invariant Derived loop invariant: (((((j == 0 && ldv_count_2 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (((j == 0 && 6 <= ldv_count_1) && ldv_count_2 == 0) && err == 0)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((6 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && ldv_count_2 == 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) - InvariantResult [Line: 2567]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1679]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: (((ldv_count_2 <= ldv_count_1 && sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || ((ldv_count_2 + 1 <= ldv_count_1 && sensor_type == 2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((6 <= ldv_count_1 && sensor_type == 2) && ldv_count_2 == 0) && err == 0) - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2271]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1937]: Loop Invariant Derived loop invariant: (((ldv_count_2 <= ldv_count_1 && sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || ((ldv_count_2 + 1 <= ldv_count_1 && sensor_type == 2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || ((sensor_type == 2 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (((6 <= ldv_count_1 && sensor_type == 2) && ldv_count_2 == 0) && err == 0) - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1660]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2408]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2454]: Loop Invariant Derived loop invariant: (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2408]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1630]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2122]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1916]: Loop Invariant Derived loop invariant: ((((tmp___1 == 0 && ldv_count_2 + 1 <= ldv_count_1) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (((tmp___1 == 0 && 6 <= ldv_count_1) && err == 0) && ldv_count_2 == 0)) || ((tmp___1 == 0 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && tmp___1 == 0 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1826]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2008]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || ((\result + 12 <= 0 && 6 <= ldv_count_1 && ldv_count_2 == 0) && err + 12 <= 0)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 2321]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1833]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2550]: Loop Invariant Derived loop invariant: 6 <= ldv_count_1 && ldv_count_2 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2539]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2528]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2539]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2539]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2558]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2470]: Loop Invariant Derived loop invariant: (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute)) - InvariantResult [Line: 1725]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2558]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2503]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute_2) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - InvariantResult [Line: 1682]: Loop Invariant Derived loop invariant: (((!(0 == ldv_call_dev_attr_of_sensor_device_attribute) && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2)) || (ldv_count_2 + 1 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute_2))) || (ldv_count_2 <= ldv_count_1 && !(0 == ldv_call_dev_attr_of_sensor_device_attribute))) || (6 <= ldv_count_1 && ldv_count_2 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 217 locations, 3 error locations. SAFE Result, 53.8s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 34.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 8371 SDtfs, 11381 SDslu, 17185 SDs, 0 SdLazy, 643 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 347 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1150occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 11179 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 1381 NumberOfFragments, 3983 HoareAnnotationTreeSize, 128 FomulaSimplifications, 14723067 FormulaSimplificationTreeSizeReduction, 8.7s HoareSimplificationTime, 128 FomulaSimplificationsInter, 732120 FormulaSimplificationTreeSizeReductionInter, 25.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2504 NumberOfCodeBlocks, 2504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2481 ConstructedInterpolants, 0 QuantifiedInterpolants, 729965 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3707 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 251/379 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...