/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:38:57,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:38:57,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:38:57,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:38:57,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:38:57,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:38:57,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:38:57,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:38:57,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:38:57,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:38:57,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:38:57,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:38:57,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:38:57,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:38:57,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:38:57,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:38:57,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:38:57,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:38:57,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:38:57,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:38:57,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:38:57,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:38:57,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:38:57,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:38:57,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:38:57,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:38:57,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:38:57,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:38:57,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:38:57,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:38:57,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:38:57,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:38:57,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:38:57,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:38:57,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:38:57,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:38:57,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:38:57,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:38:57,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:38:57,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:38:57,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:38:57,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 03:38:57,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:38:57,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:38:57,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:38:57,753 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:38:57,753 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:38:57,753 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:38:57,753 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:38:57,754 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:38:57,754 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:38:57,754 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:38:57,754 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:38:57,754 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:38:57,754 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:38:57,755 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:38:57,755 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:38:57,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:38:57,756 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:38:57,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:38:57,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:38:57,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:38:57,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:38:57,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:38:57,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:38:57,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:38:57,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:38:57,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:38:57,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:38:57,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:38:57,759 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:38:57,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:38:57,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:38:57,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:38:57,760 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:38:58,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:38:58,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:38:58,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:38:58,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:38:58,054 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:38:58,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2019-11-24 03:38:58,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f282f9d0/e80c18745e5549e5a2af9dcd0c6e26f7/FLAG192e32352 [2019-11-24 03:38:58,963 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:38:58,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2019-11-24 03:38:59,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f282f9d0/e80c18745e5549e5a2af9dcd0c6e26f7/FLAG192e32352 [2019-11-24 03:38:59,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f282f9d0/e80c18745e5549e5a2af9dcd0c6e26f7 [2019-11-24 03:38:59,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:38:59,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:38:59,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:38:59,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:38:59,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:38:59,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:38:59" (1/1) ... [2019-11-24 03:38:59,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b0091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:38:59, skipping insertion in model container [2019-11-24 03:38:59,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:38:59" (1/1) ... [2019-11-24 03:38:59,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:38:59,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:39:01,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:39:02,076 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:39:02,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:39:02,676 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:39:02,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02 WrapperNode [2019-11-24 03:39:02,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:39:02,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:39:02,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:39:02,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:39:02,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:02,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:39:03,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:39:03,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:39:03,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:39:03,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (1/1) ... [2019-11-24 03:39:03,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:39:03,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:39:03,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:39:03,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:39:03,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (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-11-24 03:39:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 03:39:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 03:39:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:39:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-24 03:39:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:39:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:39:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:39:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_post_reset [2019-11-24 03:39:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_post_reset [2019-11-24 03:39:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 03:39:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 03:39:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:39:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_resume [2019-11-24 03:39:03,609 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_resume [2019-11-24 03:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-11-24 03:39:03,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-11-24 03:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:39:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:39:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:40:11,399 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:40:11,399 INFO L284 CfgBuilder]: Removed 765 assume(true) statements. [2019-11-24 03:40:11,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:40:11 BoogieIcfgContainer [2019-11-24 03:40:11,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:40:11,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:40:11,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:40:11,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:40:11,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:38:59" (1/3) ... [2019-11-24 03:40:11,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04f6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:40:11, skipping insertion in model container [2019-11-24 03:40:11,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:39:02" (2/3) ... [2019-11-24 03:40:11,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04f6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:40:11, skipping insertion in model container [2019-11-24 03:40:11,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:40:11" (3/3) ... [2019-11-24 03:40:11,409 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2019-11-24 03:40:11,419 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:40:11,427 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 03:40:11,438 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 03:40:11,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:40:11,464 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:40:11,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:40:11,464 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:40:11,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:40:11,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:40:11,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:40:11,465 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:40:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2019-11-24 03:40:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 03:40:11,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:11,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:11,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash 761272804, now seen corresponding path program 1 times [2019-11-24 03:40:11,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:11,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735410631] [2019-11-24 03:40:11,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:12,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735410631] [2019-11-24 03:40:12,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:12,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:40:12,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742272665] [2019-11-24 03:40:12,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:12,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:12,331 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 3 states. [2019-11-24 03:40:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:12,855 INFO L93 Difference]: Finished difference Result 569 states and 953 transitions. [2019-11-24 03:40:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:12,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 03:40:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:12,886 INFO L225 Difference]: With dead ends: 569 [2019-11-24 03:40:12,886 INFO L226 Difference]: Without dead ends: 365 [2019-11-24 03:40:12,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-24 03:40:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2019-11-24 03:40:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-24 03:40:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 589 transitions. [2019-11-24 03:40:13,016 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 589 transitions. Word has length 11 [2019-11-24 03:40:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:13,016 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 589 transitions. [2019-11-24 03:40:13,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 589 transitions. [2019-11-24 03:40:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 03:40:13,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:13,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:13,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 568436573, now seen corresponding path program 1 times [2019-11-24 03:40:13,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:13,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355700878] [2019-11-24 03:40:13,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:13,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355700878] [2019-11-24 03:40:13,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:40:13,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928920423] [2019-11-24 03:40:13,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:13,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:13,360 INFO L87 Difference]: Start difference. First operand 361 states and 589 transitions. Second operand 3 states. [2019-11-24 03:40:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:13,389 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2019-11-24 03:40:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:13,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 03:40:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:13,393 INFO L225 Difference]: With dead ends: 361 [2019-11-24 03:40:13,393 INFO L226 Difference]: Without dead ends: 359 [2019-11-24 03:40:13,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-24 03:40:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2019-11-24 03:40:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-24 03:40:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2019-11-24 03:40:13,580 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 14 [2019-11-24 03:40:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:13,581 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2019-11-24 03:40:13,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2019-11-24 03:40:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 03:40:13,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:13,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:13,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:13,587 INFO L82 PathProgramCache]: Analyzing trace with hash 441671212, now seen corresponding path program 1 times [2019-11-24 03:40:13,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:13,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091561471] [2019-11-24 03:40:13,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:13,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091561471] [2019-11-24 03:40:13,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:13,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:40:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52791019] [2019-11-24 03:40:13,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:13,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:13,905 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand 3 states. [2019-11-24 03:40:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:13,925 INFO L93 Difference]: Finished difference Result 359 states and 587 transitions. [2019-11-24 03:40:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:13,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 03:40:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:13,928 INFO L225 Difference]: With dead ends: 359 [2019-11-24 03:40:13,928 INFO L226 Difference]: Without dead ends: 357 [2019-11-24 03:40:13,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:13,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-24 03:40:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-11-24 03:40:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-24 03:40:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 585 transitions. [2019-11-24 03:40:13,949 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 585 transitions. Word has length 15 [2019-11-24 03:40:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 585 transitions. [2019-11-24 03:40:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 585 transitions. [2019-11-24 03:40:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 03:40:13,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:13,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:13,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash 806912327, now seen corresponding path program 1 times [2019-11-24 03:40:13,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:13,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318547181] [2019-11-24 03:40:13,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:14,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318547181] [2019-11-24 03:40:14,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:14,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:40:14,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141794565] [2019-11-24 03:40:14,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:14,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:14,266 INFO L87 Difference]: Start difference. First operand 357 states and 585 transitions. Second operand 3 states. [2019-11-24 03:40:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:14,287 INFO L93 Difference]: Finished difference Result 357 states and 585 transitions. [2019-11-24 03:40:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:14,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 03:40:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:14,290 INFO L225 Difference]: With dead ends: 357 [2019-11-24 03:40:14,290 INFO L226 Difference]: Without dead ends: 355 [2019-11-24 03:40:14,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-24 03:40:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2019-11-24 03:40:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-24 03:40:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 583 transitions. [2019-11-24 03:40:14,314 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 583 transitions. Word has length 16 [2019-11-24 03:40:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:14,315 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 583 transitions. [2019-11-24 03:40:14,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 583 transitions. [2019-11-24 03:40:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 03:40:14,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:14,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:14,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash -755514986, now seen corresponding path program 1 times [2019-11-24 03:40:14,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:14,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436923674] [2019-11-24 03:40:14,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:14,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436923674] [2019-11-24 03:40:14,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:14,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:40:14,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376497594] [2019-11-24 03:40:14,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:14,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:14,629 INFO L87 Difference]: Start difference. First operand 355 states and 583 transitions. Second operand 3 states. [2019-11-24 03:40:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:14,692 INFO L93 Difference]: Finished difference Result 1051 states and 1733 transitions. [2019-11-24 03:40:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:14,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 03:40:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:14,697 INFO L225 Difference]: With dead ends: 1051 [2019-11-24 03:40:14,697 INFO L226 Difference]: Without dead ends: 695 [2019-11-24 03:40:14,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-11-24 03:40:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 692. [2019-11-24 03:40:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-24 03:40:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1143 transitions. [2019-11-24 03:40:14,740 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1143 transitions. Word has length 17 [2019-11-24 03:40:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:14,741 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1143 transitions. [2019-11-24 03:40:14,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1143 transitions. [2019-11-24 03:40:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 03:40:14,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:14,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:40:14,743 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 281805742, now seen corresponding path program 1 times [2019-11-24 03:40:14,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:14,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495901683] [2019-11-24 03:40:14,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:40:14,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495901683] [2019-11-24 03:40:14,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:14,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:40:14,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344343188] [2019-11-24 03:40:14,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:14,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:14,975 INFO L87 Difference]: Start difference. First operand 692 states and 1143 transitions. Second operand 3 states. [2019-11-24 03:40:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:15,163 INFO L93 Difference]: Finished difference Result 1083 states and 1780 transitions. [2019-11-24 03:40:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:15,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 03:40:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:15,169 INFO L225 Difference]: With dead ends: 1083 [2019-11-24 03:40:15,170 INFO L226 Difference]: Without dead ends: 394 [2019-11-24 03:40:15,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-24 03:40:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 388. [2019-11-24 03:40:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-24 03:40:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 634 transitions. [2019-11-24 03:40:15,193 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 634 transitions. Word has length 18 [2019-11-24 03:40:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:15,194 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 634 transitions. [2019-11-24 03:40:15,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 634 transitions. [2019-11-24 03:40:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 03:40:15,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:15,195 INFO L410 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] [2019-11-24 03:40:15,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash 7862765, now seen corresponding path program 1 times [2019-11-24 03:40:15,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215708434] [2019-11-24 03:40:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:40:15,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215708434] [2019-11-24 03:40:15,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:15,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:40:15,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613666522] [2019-11-24 03:40:15,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:15,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:15,535 INFO L87 Difference]: Start difference. First operand 388 states and 634 transitions. Second operand 3 states. [2019-11-24 03:40:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:15,585 INFO L93 Difference]: Finished difference Result 869 states and 1419 transitions. [2019-11-24 03:40:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:15,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 03:40:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:15,589 INFO L225 Difference]: With dead ends: 869 [2019-11-24 03:40:15,590 INFO L226 Difference]: Without dead ends: 495 [2019-11-24 03:40:15,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-24 03:40:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 392. [2019-11-24 03:40:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-24 03:40:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 638 transitions. [2019-11-24 03:40:15,618 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 638 transitions. Word has length 27 [2019-11-24 03:40:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:15,619 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 638 transitions. [2019-11-24 03:40:15,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 638 transitions. [2019-11-24 03:40:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 03:40:15,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:15,620 INFO L410 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] [2019-11-24 03:40:15,621 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2135962507, now seen corresponding path program 1 times [2019-11-24 03:40:15,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:15,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986151309] [2019-11-24 03:40:15,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:40:15,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986151309] [2019-11-24 03:40:15,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:15,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:40:15,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754802686] [2019-11-24 03:40:15,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:40:15,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:40:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:40:15,926 INFO L87 Difference]: Start difference. First operand 392 states and 638 transitions. Second operand 4 states. [2019-11-24 03:40:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:16,024 INFO L93 Difference]: Finished difference Result 1035 states and 1679 transitions. [2019-11-24 03:40:16,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:40:16,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 03:40:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:16,030 INFO L225 Difference]: With dead ends: 1035 [2019-11-24 03:40:16,030 INFO L226 Difference]: Without dead ends: 657 [2019-11-24 03:40:16,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:40:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-24 03:40:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 391. [2019-11-24 03:40:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-24 03:40:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 635 transitions. [2019-11-24 03:40:16,062 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 635 transitions. Word has length 31 [2019-11-24 03:40:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:16,064 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 635 transitions. [2019-11-24 03:40:16,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:40:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 635 transitions. [2019-11-24 03:40:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 03:40:16,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:16,068 INFO L410 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] [2019-11-24 03:40:16,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1160521645, now seen corresponding path program 1 times [2019-11-24 03:40:16,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:16,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336239639] [2019-11-24 03:40:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:40:16,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336239639] [2019-11-24 03:40:16,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:16,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:40:16,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989300473] [2019-11-24 03:40:16,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:16,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:16,364 INFO L87 Difference]: Start difference. First operand 391 states and 635 transitions. Second operand 3 states. [2019-11-24 03:40:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:16,975 INFO L93 Difference]: Finished difference Result 766 states and 1249 transitions. [2019-11-24 03:40:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:16,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 03:40:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:16,979 INFO L225 Difference]: With dead ends: 766 [2019-11-24 03:40:16,979 INFO L226 Difference]: Without dead ends: 389 [2019-11-24 03:40:16,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-24 03:40:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2019-11-24 03:40:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-24 03:40:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 632 transitions. [2019-11-24 03:40:17,002 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 632 transitions. Word has length 32 [2019-11-24 03:40:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:17,003 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 632 transitions. [2019-11-24 03:40:17,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 632 transitions. [2019-11-24 03:40:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 03:40:17,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:17,009 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 03:40:17,009 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -828012913, now seen corresponding path program 1 times [2019-11-24 03:40:17,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262084621] [2019-11-24 03:40:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:40:17,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262084621] [2019-11-24 03:40:17,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:17,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:40:17,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641061232] [2019-11-24 03:40:17,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:40:17,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:40:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:40:17,461 INFO L87 Difference]: Start difference. First operand 389 states and 632 transitions. Second operand 4 states. [2019-11-24 03:40:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:17,535 INFO L93 Difference]: Finished difference Result 687 states and 1112 transitions. [2019-11-24 03:40:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:40:17,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-24 03:40:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:17,540 INFO L225 Difference]: With dead ends: 687 [2019-11-24 03:40:17,540 INFO L226 Difference]: Without dead ends: 499 [2019-11-24 03:40:17,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:40:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-24 03:40:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 389. [2019-11-24 03:40:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-24 03:40:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 631 transitions. [2019-11-24 03:40:17,572 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 631 transitions. Word has length 44 [2019-11-24 03:40:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:17,574 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 631 transitions. [2019-11-24 03:40:17,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:40:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 631 transitions. [2019-11-24 03:40:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 03:40:17,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:40:17,576 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 03:40:17,576 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:40:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:40:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 906822767, now seen corresponding path program 1 times [2019-11-24 03:40:17,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:40:17,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869643319] [2019-11-24 03:40:17,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:40:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:40:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:40:17,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869643319] [2019-11-24 03:40:17,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:40:17,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:40:17,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554325179] [2019-11-24 03:40:17,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:40:17,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:40:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:40:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:17,831 INFO L87 Difference]: Start difference. First operand 389 states and 631 transitions. Second operand 3 states. [2019-11-24 03:40:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:40:17,867 INFO L93 Difference]: Finished difference Result 438 states and 710 transitions. [2019-11-24 03:40:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:40:17,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 03:40:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:40:17,868 INFO L225 Difference]: With dead ends: 438 [2019-11-24 03:40:17,868 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 03:40:17,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:40:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 03:40:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 03:40:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 03:40:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 03:40:17,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-24 03:40:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:40:17,871 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 03:40:17,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:40:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 03:40:17,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 03:40:17,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 03:40:19,781 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 12 [2019-11-24 03:40:20,343 INFO L447 ceAbstractionStarter]: At program point L8637(line 8637) the Hoare annotation is: true [2019-11-24 03:40:20,343 INFO L447 ceAbstractionStarter]: At program point L8637-1(line 8637) the Hoare annotation is: true [2019-11-24 03:40:20,343 INFO L444 ceAbstractionStarter]: For program point p54u_post_resetEXIT(lines 8628 8649) no Hoare annotation was computed. [2019-11-24 03:40:20,343 INFO L447 ceAbstractionStarter]: At program point p54u_post_resetENTRY(lines 8628 8649) the Hoare annotation is: true [2019-11-24 03:40:20,344 INFO L447 ceAbstractionStarter]: At program point p54u_resumeENTRY(lines 8603 8627) the Hoare annotation is: true [2019-11-24 03:40:20,344 INFO L444 ceAbstractionStarter]: For program point p54u_resumeEXIT(lines 8603 8627) no Hoare annotation was computed. [2019-11-24 03:40:20,344 INFO L444 ceAbstractionStarter]: For program point p54u_resumeFINAL(lines 8603 8627) no Hoare annotation was computed. [2019-11-24 03:40:20,344 INFO L444 ceAbstractionStarter]: For program point L8620(lines 8620 8623) no Hoare annotation was computed. [2019-11-24 03:40:20,345 INFO L447 ceAbstractionStarter]: At program point L8624(line 8624) the Hoare annotation is: true [2019-11-24 03:40:20,345 INFO L444 ceAbstractionStarter]: For program point L8624-1(line 8624) no Hoare annotation was computed. [2019-11-24 03:40:20,345 INFO L447 ceAbstractionStarter]: At program point L8613(lines 8613 8616) the Hoare annotation is: true [2019-11-24 03:40:20,345 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,345 INFO L444 ceAbstractionStarter]: For program point L8789(line 8789) no Hoare annotation was computed. [2019-11-24 03:40:20,346 INFO L440 ceAbstractionStarter]: At program point L7633(lines 7605 7635) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,346 INFO L440 ceAbstractionStarter]: At program point L8790(lines 8790 8802) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,346 INFO L444 ceAbstractionStarter]: For program point L8923(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,346 INFO L444 ceAbstractionStarter]: For program point L8923-1(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,346 INFO L444 ceAbstractionStarter]: For program point L8923-2(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,346 INFO L444 ceAbstractionStarter]: For program point L8923-3(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L444 ceAbstractionStarter]: For program point L8923-4(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L444 ceAbstractionStarter]: For program point L8923-5(line 8923) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L444 ceAbstractionStarter]: For program point L8792-2(lines 8790 8801) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L440 ceAbstractionStarter]: At program point L8562(lines 8488 8564) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,347 INFO L444 ceAbstractionStarter]: For program point L8760(line 8760) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L444 ceAbstractionStarter]: For program point L8761(lines 8761 8768) no Hoare annotation was computed. [2019-11-24 03:40:20,347 INFO L440 ceAbstractionStarter]: At program point L8762(line 8762) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,348 INFO L444 ceAbstractionStarter]: For program point L8729(line 8729) no Hoare annotation was computed. [2019-11-24 03:40:20,348 INFO L444 ceAbstractionStarter]: For program point L8762-1(line 8762) no Hoare annotation was computed. [2019-11-24 03:40:20,348 INFO L444 ceAbstractionStarter]: For program point L8730(lines 8730 8737) no Hoare annotation was computed. [2019-11-24 03:40:20,348 INFO L440 ceAbstractionStarter]: At program point L8532(lines 8498 8563) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,348 INFO L444 ceAbstractionStarter]: For program point L9556(lines 9555 9573) no Hoare annotation was computed. [2019-11-24 03:40:20,348 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,348 INFO L440 ceAbstractionStarter]: At program point L8731(line 8731) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,349 INFO L444 ceAbstractionStarter]: For program point L8731-1(line 8731) no Hoare annotation was computed. [2019-11-24 03:40:20,349 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,349 INFO L440 ceAbstractionStarter]: At program point L8798(lines 9556 9559) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,349 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,349 INFO L440 ceAbstractionStarter]: At program point L8535(lines 8535 8538) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,350 INFO L440 ceAbstractionStarter]: At program point L8502(lines 8502 8506) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,350 INFO L444 ceAbstractionStarter]: For program point L9560(lines 9555 9573) no Hoare annotation was computed. [2019-11-24 03:40:20,350 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,350 INFO L440 ceAbstractionStarter]: At program point L8934(lines 8934 8937) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (not (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,350 INFO L440 ceAbstractionStarter]: At program point L7613-2(lines 7613 7622) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse2 (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) (and .cse0 (not .cse2) .cse1 (= 2 ~ldv_mutex_udev_of_p54u_priv~0) (= ULTIMATE.start_p54u_device_reset_~ret~1 0) .cse3 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_of_p54u_priv_#res| 0)))) [2019-11-24 03:40:20,350 INFO L440 ceAbstractionStarter]: At program point L7613(lines 7613 7622) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,351 INFO L444 ceAbstractionStarter]: For program point L8770(line 8770) no Hoare annotation was computed. [2019-11-24 03:40:20,351 INFO L444 ceAbstractionStarter]: For program point L8804(line 8804) no Hoare annotation was computed. [2019-11-24 03:40:20,351 INFO L444 ceAbstractionStarter]: For program point L7615(lines 7615 7620) no Hoare annotation was computed. [2019-11-24 03:40:20,351 INFO L444 ceAbstractionStarter]: For program point L9564(lines 9555 9573) no Hoare annotation was computed. [2019-11-24 03:40:20,351 INFO L440 ceAbstractionStarter]: At program point L8739(line 8739) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,351 INFO L444 ceAbstractionStarter]: For program point L8541(lines 8541 8555) no Hoare annotation was computed. [2019-11-24 03:40:20,352 INFO L440 ceAbstractionStarter]: At program point L8541-2(lines 8541 8555) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,352 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,352 INFO L447 ceAbstractionStarter]: At program point L9568(lines 9553 9574) the Hoare annotation is: true [2019-11-24 03:40:20,352 INFO L447 ceAbstractionStarter]: At program point L6729-3(lines 6728 6731) the Hoare annotation is: true [2019-11-24 03:40:20,352 INFO L447 ceAbstractionStarter]: At program point L6729-2(lines 6728 6731) the Hoare annotation is: true [2019-11-24 03:40:20,352 INFO L447 ceAbstractionStarter]: At program point L6729-1(lines 6728 6731) the Hoare annotation is: true [2019-11-24 03:40:20,353 INFO L447 ceAbstractionStarter]: At program point L6729(lines 6728 6731) the Hoare annotation is: true [2019-11-24 03:40:20,353 INFO L444 ceAbstractionStarter]: For program point L8777(line 8777) no Hoare annotation was computed. [2019-11-24 03:40:20,353 INFO L440 ceAbstractionStarter]: At program point L9537(lines 9537 9543) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (not (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,353 INFO L444 ceAbstractionStarter]: For program point L8811(line 8811) no Hoare annotation was computed. [2019-11-24 03:40:20,353 INFO L444 ceAbstractionStarter]: For program point L8778(lines 8778 8809) no Hoare annotation was computed. [2019-11-24 03:40:20,353 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,353 INFO L444 ceAbstractionStarter]: For program point L8349(lines 8349 8352) no Hoare annotation was computed. [2019-11-24 03:40:20,354 INFO L444 ceAbstractionStarter]: For program point L8714(line 8714) no Hoare annotation was computed. [2019-11-24 03:40:20,354 INFO L444 ceAbstractionStarter]: For program point L7624-2(lines 7610 7634) no Hoare annotation was computed. [2019-11-24 03:40:20,354 INFO L440 ceAbstractionStarter]: At program point L7624(lines 7624 7627) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse2 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse1 (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 (not .cse1) .cse2 (= 2 ~ldv_mutex_udev_of_p54u_priv~0) .cse3 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_of_p54u_priv_#res| 0)) (and .cse0 .cse2 .cse1 .cse3 (= 1 ~ldv_mutex_udev_of_p54u_priv~0)))) [2019-11-24 03:40:20,354 INFO L444 ceAbstractionStarter]: For program point L8781(line 8781) no Hoare annotation was computed. [2019-11-24 03:40:20,354 INFO L444 ceAbstractionStarter]: For program point L8715(lines 8715 8775) no Hoare annotation was computed. [2019-11-24 03:40:20,354 INFO L440 ceAbstractionStarter]: At program point L8814(lines 8703 8819) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,355 INFO L444 ceAbstractionStarter]: For program point L9508(lines 9508 9511) no Hoare annotation was computed. [2019-11-24 03:40:20,355 INFO L440 ceAbstractionStarter]: At program point L9508-1(lines 9508 9511) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (not (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 2 ~ldv_mutex_udev_of_p54u_priv~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_of_p54u_priv_#res| 0)) [2019-11-24 03:40:20,355 INFO L440 ceAbstractionStarter]: At program point L8782(lines 8782 8787) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,355 INFO L440 ceAbstractionStarter]: At program point L9542(lines 9531 9545) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (not (= ULTIMATE.start_p54u_device_reset_~lock~0 0))) (.cse2 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev_of_p54u_priv~0) .cse3 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_of_p54u_priv_#res| 0)) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_of_p54u_priv_#res| 1) 0) .cse3 (= 1 ~ldv_mutex_udev_of_p54u_priv~0)))) [2019-11-24 03:40:20,355 INFO L440 ceAbstractionStarter]: At program point L8354(lines 8345 8365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,356 INFO L444 ceAbstractionStarter]: For program point L8718(line 8718) no Hoare annotation was computed. [2019-11-24 03:40:20,356 INFO L440 ceAbstractionStarter]: At program point L8719(lines 8719 8727) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,356 INFO L440 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,356 INFO L440 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,356 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8924) no Hoare annotation was computed. [2019-11-24 03:40:20,356 INFO L440 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,357 INFO L440 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,357 INFO L440 ceAbstractionStarter]: At program point L8753(line 8753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,357 INFO L444 ceAbstractionStarter]: For program point L9447(lines 9447 9450) no Hoare annotation was computed. [2019-11-24 03:40:20,357 INFO L440 ceAbstractionStarter]: At program point L9447-1(lines 9447 9450) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (not (= ULTIMATE.start_p54u_device_reset_~lock~0 0)) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,357 INFO L440 ceAbstractionStarter]: At program point L8359(lines 8345 8365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 1 ~ldv_mutex_udev_of_p54u_priv~0)) [2019-11-24 03:40:20,357 INFO L447 ceAbstractionStarter]: At program point L8029(lines 8029 8032) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point L7831(lines 7831 7834) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L444 ceAbstractionStarter]: For program point L8096(lines 8096 8099) no Hoare annotation was computed. [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point ##fun~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point L8164(lines 8164 8167) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point L7702(lines 7702 7705) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point L7372(lines 7372 7377) the Hoare annotation is: true [2019-11-24 03:40:20,358 INFO L447 ceAbstractionStarter]: At program point L7835(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L444 ceAbstractionStarter]: For program point L8232(lines 8232 8235) no Hoare annotation was computed. [2019-11-24 03:40:20,359 INFO L447 ceAbstractionStarter]: At program point L8034(lines 8034 8037) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L447 ceAbstractionStarter]: At program point L7772(lines 7772 7775) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L447 ceAbstractionStarter]: At program point L8170(lines 8170 8173) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L447 ceAbstractionStarter]: At program point L8039(lines 8039 8042) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L447 ceAbstractionStarter]: At program point L7973(lines 7973 7976) the Hoare annotation is: true [2019-11-24 03:40:20,359 INFO L444 ceAbstractionStarter]: For program point L7709(lines 7709 7712) no Hoare annotation was computed. [2019-11-24 03:40:20,360 INFO L447 ceAbstractionStarter]: At program point L7380(lines 7344 7392) the Hoare annotation is: true [2019-11-24 03:40:20,360 INFO L447 ceAbstractionStarter]: At program point L8107(lines 8107 8110) the Hoare annotation is: true [2019-11-24 03:40:20,360 INFO L444 ceAbstractionStarter]: For program point L7777(lines 7777 7781) no Hoare annotation was computed. [2019-11-24 03:40:20,360 INFO L447 ceAbstractionStarter]: At program point L7844(lines 7844 7848) the Hoare annotation is: true [2019-11-24 03:40:20,360 INFO L447 ceAbstractionStarter]: At program point L7382(lines 7382 7385) the Hoare annotation is: true [2019-11-24 03:40:20,360 INFO L447 ceAbstractionStarter]: At program point L8176(lines 8176 8179) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L7978(lines 7978 7981) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L8243(lines 8243 8246) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L8045(lines 8045 8048) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L8113(lines 8113 8116) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L7916(lines 7916 7919) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L447 ceAbstractionStarter]: At program point L7983(lines 7983 7986) the Hoare annotation is: true [2019-11-24 03:40:20,361 INFO L444 ceAbstractionStarter]: For program point L8182(lines 8182 8185) no Hoare annotation was computed. [2019-11-24 03:40:20,362 INFO L447 ceAbstractionStarter]: At program point L8051(lines 8051 8054) the Hoare annotation is: true [2019-11-24 03:40:20,362 INFO L447 ceAbstractionStarter]: At program point L7787(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,362 INFO L444 ceAbstractionStarter]: For program point L7853-2(lines 7853 7856) no Hoare annotation was computed. [2019-11-24 03:40:20,362 INFO L447 ceAbstractionStarter]: At program point L7391(lines 7334 7393) the Hoare annotation is: true [2019-11-24 03:40:20,362 INFO L447 ceAbstractionStarter]: At program point L8250(lines 8250 8253) the Hoare annotation is: true [2019-11-24 03:40:20,362 INFO L444 ceAbstractionStarter]: For program point L8119(lines 8119 8122) no Hoare annotation was computed. [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L7921(lines 7921 7924) the Hoare annotation is: true [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L7789(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L7988(lines 7988 7991) the Hoare annotation is: true [2019-11-24 03:40:20,363 INFO L444 ceAbstractionStarter]: For program point L7857(lines 7857 7861) no Hoare annotation was computed. [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L9576-3(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L9576-4(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,363 INFO L447 ceAbstractionStarter]: At program point L9576-5(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576-6(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576-1(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576-2(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576-7(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,364 INFO L447 ceAbstractionStarter]: At program point L9576-8(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,365 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,365 INFO L447 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,365 INFO L444 ceAbstractionStarter]: For program point L8257(lines 8257 8260) no Hoare annotation was computed. [2019-11-24 03:40:20,365 INFO L444 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,365 INFO L447 ceAbstractionStarter]: At program point L-1-4(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,365 INFO L444 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,365 INFO L447 ceAbstractionStarter]: At program point L-1-7(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L444 ceAbstractionStarter]: For program point L-1-8(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,366 INFO L447 ceAbstractionStarter]: At program point L-1-10(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L447 ceAbstractionStarter]: At program point L7795(lines 7795 7799) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L447 ceAbstractionStarter]: At program point L-1-12(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L447 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L447 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,366 INFO L444 ceAbstractionStarter]: For program point L-1-19(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,367 INFO L447 ceAbstractionStarter]: At program point L-1-21(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,367 INFO L444 ceAbstractionStarter]: For program point L-1-22(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,367 INFO L447 ceAbstractionStarter]: At program point L-1-24(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,367 INFO L447 ceAbstractionStarter]: At program point L-1-26(line -1) the Hoare annotation is: true [2019-11-24 03:40:20,367 INFO L444 ceAbstractionStarter]: For program point L-1-29(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,367 INFO L447 ceAbstractionStarter]: At program point L7994(lines 7994 7997) the Hoare annotation is: true [2019-11-24 03:40:20,367 INFO L444 ceAbstractionStarter]: For program point L8060(lines 8060 8063) no Hoare annotation was computed. [2019-11-24 03:40:20,368 INFO L447 ceAbstractionStarter]: At program point L7862(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,368 INFO L444 ceAbstractionStarter]: For program point L7928(lines 7928 7931) no Hoare annotation was computed. [2019-11-24 03:40:20,368 INFO L447 ceAbstractionStarter]: At program point L8193(lines 8193 8196) the Hoare annotation is: true [2019-11-24 03:40:20,368 INFO L447 ceAbstractionStarter]: At program point L7866(lines 7866 7869) the Hoare annotation is: true [2019-11-24 03:40:20,368 INFO L447 ceAbstractionStarter]: At program point L7999(lines 7999 8002) the Hoare annotation is: true [2019-11-24 03:40:20,368 INFO L444 ceAbstractionStarter]: For program point L8199(lines 8199 8202) no Hoare annotation was computed. [2019-11-24 03:40:20,368 INFO L447 ceAbstractionStarter]: At program point L8133(lines 8133 8137) the Hoare annotation is: true [2019-11-24 03:40:20,369 INFO L444 ceAbstractionStarter]: For program point ##fun~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-11-24 03:40:20,369 INFO L447 ceAbstractionStarter]: At program point L7870(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,369 INFO L444 ceAbstractionStarter]: For program point L7804-2(lines 7804 7811) no Hoare annotation was computed. [2019-11-24 03:40:20,369 INFO L444 ceAbstractionStarter]: For program point L7804(lines 7804 7811) no Hoare annotation was computed. [2019-11-24 03:40:20,369 INFO L447 ceAbstractionStarter]: At program point L8268(lines 8268 8271) the Hoare annotation is: true [2019-11-24 03:40:20,369 INFO L447 ceAbstractionStarter]: At program point L8004(lines 8004 8007) the Hoare annotation is: true [2019-11-24 03:40:20,369 INFO L444 ceAbstractionStarter]: For program point L7806(lines 7806 7809) no Hoare annotation was computed. [2019-11-24 03:40:20,369 INFO L447 ceAbstractionStarter]: At program point L8071(lines 8071 8074) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L8203-2(lines 8203 8207) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L7939(lines 7939 7942) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L7874(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L8337(lines 7912 8340) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L8140(lines 8140 8143) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L7876(lines 7663 7878) the Hoare annotation is: true [2019-11-24 03:40:20,370 INFO L447 ceAbstractionStarter]: At program point L8339(lines 7879 8341) the Hoare annotation is: true [2019-11-24 03:40:20,371 INFO L447 ceAbstractionStarter]: At program point L8009(lines 8009 8012) the Hoare annotation is: true [2019-11-24 03:40:20,371 INFO L444 ceAbstractionStarter]: For program point L7812-2(lines 7698 7877) no Hoare annotation was computed. [2019-11-24 03:40:20,371 INFO L444 ceAbstractionStarter]: For program point L7812(lines 7812 7820) no Hoare annotation was computed. [2019-11-24 03:40:20,371 INFO L444 ceAbstractionStarter]: For program point L8209(lines 8209 8212) no Hoare annotation was computed. [2019-11-24 03:40:20,371 INFO L447 ceAbstractionStarter]: At program point L7351(lines 7351 7355) the Hoare annotation is: true [2019-11-24 03:40:20,371 INFO L444 ceAbstractionStarter]: For program point L8078(lines 8078 8081) no Hoare annotation was computed. [2019-11-24 03:40:20,371 INFO L444 ceAbstractionStarter]: For program point L7946(lines 7946 7949) no Hoare annotation was computed. [2019-11-24 03:40:20,372 INFO L444 ceAbstractionStarter]: For program point L7814(lines 7814 7818) no Hoare annotation was computed. [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L8146(lines 8146 8149) the Hoare annotation is: true [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L8014(lines 8014 8017) the Hoare annotation is: true [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L9735(lines 1 9743) the Hoare annotation is: true [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L7357(lines 7357 7361) the Hoare annotation is: true [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L8216(lines 7912 8340) the Hoare annotation is: true [2019-11-24 03:40:20,372 INFO L447 ceAbstractionStarter]: At program point L8019(lines 8019 8022) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L8152(lines 8152 8155) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L8089(lines 8089 8092) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L7957(lines 7957 7960) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L8024(lines 8024 8027) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L8223(lines 8223 8226) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L7827(lines 7698 7877) the Hoare annotation is: true [2019-11-24 03:40:20,373 INFO L447 ceAbstractionStarter]: At program point L8158(lines 8158 8161) the Hoare annotation is: true [2019-11-24 03:40:20,374 INFO L444 ceAbstractionStarter]: For program point L7962(lines 7962 7965) no Hoare annotation was computed. [2019-11-24 03:40:20,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 03:40:20 BoogieIcfgContainer [2019-11-24 03:40:20,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 03:40:20,403 INFO L168 Benchmark]: Toolchain (without parser) took 80947.65 ms. Allocated memory was 138.9 MB in the beginning and 955.3 MB in the end (delta: 816.3 MB). Free memory was 91.1 MB in the beginning and 239.3 MB in the end (delta: -148.2 MB). Peak memory consumption was 668.1 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,404 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3221.11 ms. Allocated memory was 138.9 MB in the beginning and 252.2 MB in the end (delta: 113.2 MB). Free memory was 90.9 MB in the beginning and 142.5 MB in the end (delta: -51.6 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 377.39 ms. Allocated memory is still 252.2 MB. Free memory was 142.5 MB in the beginning and 103.2 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,407 INFO L168 Benchmark]: Boogie Preprocessor took 475.37 ms. Allocated memory was 252.2 MB in the beginning and 262.7 MB in the end (delta: 10.5 MB). Free memory was 103.2 MB in the beginning and 167.1 MB in the end (delta: -63.9 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,408 INFO L168 Benchmark]: RCFGBuilder took 67869.60 ms. Allocated memory was 262.7 MB in the beginning and 869.8 MB in the end (delta: 607.1 MB). Free memory was 167.1 MB in the beginning and 284.1 MB in the end (delta: -117.0 MB). Peak memory consumption was 671.7 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,408 INFO L168 Benchmark]: TraceAbstraction took 8999.18 ms. Allocated memory was 869.8 MB in the beginning and 955.3 MB in the end (delta: 85.5 MB). Free memory was 284.1 MB in the beginning and 239.3 MB in the end (delta: 44.8 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. [2019-11-24 03:40:20,414 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3221.11 ms. Allocated memory was 138.9 MB in the beginning and 252.2 MB in the end (delta: 113.2 MB). Free memory was 90.9 MB in the beginning and 142.5 MB in the end (delta: -51.6 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 377.39 ms. Allocated memory is still 252.2 MB. Free memory was 142.5 MB in the beginning and 103.2 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 475.37 ms. Allocated memory was 252.2 MB in the beginning and 262.7 MB in the end (delta: 10.5 MB). Free memory was 103.2 MB in the beginning and 167.1 MB in the end (delta: -63.9 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 67869.60 ms. Allocated memory was 262.7 MB in the beginning and 869.8 MB in the end (delta: 607.1 MB). Free memory was 167.1 MB in the beginning and 284.1 MB in the end (delta: -117.0 MB). Peak memory consumption was 671.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8999.18 ms. Allocated memory was 869.8 MB in the beginning and 955.3 MB in the end (delta: 85.5 MB). Free memory was 284.1 MB in the beginning and 239.3 MB in the end (delta: 44.8 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8924]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 8502]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 9537]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7912]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8535]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7916]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7382]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8934]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 6728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7357]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8498]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7912]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8628]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8158]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8034]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8045]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8268]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7866]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8719]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7844]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9531]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 2 == ldv_mutex_udev_of_p54u_priv) && 1 == ldv_mutex_mutex_of_device) && \result == 0) || (((((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv) - InvariantResult [Line: 8089]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8243]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8488]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8170]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7334]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7344]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8024]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8782]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7702]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7988]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7999]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8790]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7831]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7795]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8051]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8029]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9556]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9508]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 2 == ldv_mutex_udev_of_p54u_priv) && 1 == ldv_mutex_mutex_of_device) && \result == 0 - InvariantResult [Line: 8176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8019]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8603]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7939]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7372]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8703]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8140]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7994]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7605]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7983]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9447]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8071]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8009]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8345]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8541]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8753]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7973]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7879]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7772]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8039]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8739]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7613]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && lock == 0) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv) || ((((((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 2 == ldv_mutex_udev_of_p54u_priv) && ret == 0) && 1 == ldv_mutex_mutex_of_device) && \result == 0) - InvariantResult [Line: 7698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8146]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8345]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 7624]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && !(lock == 0)) && 1 == ldv_mutex_i_mutex_of_inode) && 2 == ldv_mutex_udev_of_p54u_priv) && 1 == ldv_mutex_mutex_of_device) && \result == 0) || ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && lock == 0) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv) - InvariantResult [Line: 7613]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 1 == ldv_mutex_udev_of_p54u_priv - InvariantResult [Line: 8113]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 197 locations, 6 error locations. Result: SAFE, OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 3868 SDtfs, 2200 SDslu, 3105 SDs, 0 SdLazy, 80 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 492 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 122 LocationsWithAnnotation, 1592 PreInvPairs, 1674 NumberOfFragments, 579 HoareAnnotationTreeSize, 1592 FomulaSimplifications, 7306 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 122 FomulaSimplificationsInter, 4793 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 11327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...