./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46c36fd07cc60a39e7730aed0a49b29fd44b0553 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-15 17:13:21,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 17:13:21,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 17:13:21,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 17:13:21,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 17:13:21,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 17:13:21,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 17:13:21,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 17:13:21,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 17:13:21,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 17:13:21,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 17:13:21,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 17:13:21,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 17:13:21,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 17:13:21,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 17:13:21,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 17:13:21,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 17:13:21,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 17:13:21,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 17:13:21,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 17:13:21,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 17:13:21,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 17:13:21,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 17:13:21,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 17:13:21,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 17:13:21,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 17:13:21,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 17:13:21,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 17:13:21,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 17:13:21,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 17:13:21,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 17:13:21,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 17:13:21,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 17:13:21,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 17:13:21,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 17:13:21,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 17:13:21,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-15 17:13:21,734 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 17:13:21,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 17:13:21,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 17:13:21,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 17:13:21,738 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 17:13:21,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 17:13:21,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-15 17:13:21,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 17:13:21,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 17:13:21,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 17:13:21,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 17:13:21,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 17:13:21,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 17:13:21,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 17:13:21,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 17:13:21,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 17:13:21,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 17:13:21,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 17:13:21,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 17:13:21,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 17:13:21,744 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46c36fd07cc60a39e7730aed0a49b29fd44b0553 [2019-01-15 17:13:21,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 17:13:21,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 17:13:21,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 17:13:21,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 17:13:21,838 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 17:13:21,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 17:13:21,918 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18fb39118/7f4fc7a8e04045958fa6813e2f41dd8e/FLAG47e75b59e [2019-01-15 17:13:22,693 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 17:13:22,694 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 17:13:22,735 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18fb39118/7f4fc7a8e04045958fa6813e2f41dd8e/FLAG47e75b59e [2019-01-15 17:13:22,760 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18fb39118/7f4fc7a8e04045958fa6813e2f41dd8e [2019-01-15 17:13:22,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 17:13:22,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 17:13:22,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 17:13:22,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 17:13:22,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 17:13:22,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 05:13:22" (1/1) ... [2019-01-15 17:13:22,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403861a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:22, skipping insertion in model container [2019-01-15 17:13:22,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 05:13:22" (1/1) ... [2019-01-15 17:13:22,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 17:13:22,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 17:13:24,464 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 17:13:24,534 INFO L191 MainTranslator]: Completed pre-run [2019-01-15 17:13:24,766 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 17:13:24,886 INFO L195 MainTranslator]: Completed translation [2019-01-15 17:13:24,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24 WrapperNode [2019-01-15 17:13:24,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-15 17:13:24,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-15 17:13:24,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-15 17:13:24,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-15 17:13:24,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:24,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-15 17:13:25,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-15 17:13:25,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-15 17:13:25,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-15 17:13:25,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... [2019-01-15 17:13:25,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-15 17:13:25,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-15 17:13:25,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-15 17:13:25,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-15 17:13:25,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 17:13:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-15 17:13:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-15 17:13:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-15 17:13:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-15 17:13:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-15 17:13:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-15 17:13:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-15 17:13:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-15 17:13:25,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-15 17:13:28,626 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-15 17:13:28,626 INFO L286 CfgBuilder]: Removed 127 assue(true) statements. [2019-01-15 17:13:28,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 05:13:28 BoogieIcfgContainer [2019-01-15 17:13:28,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-15 17:13:28,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-15 17:13:28,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-15 17:13:28,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-15 17:13:28,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 05:13:22" (1/3) ... [2019-01-15 17:13:28,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa1d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 05:13:28, skipping insertion in model container [2019-01-15 17:13:28,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 05:13:24" (2/3) ... [2019-01-15 17:13:28,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa1d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 05:13:28, skipping insertion in model container [2019-01-15 17:13:28,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 05:13:28" (3/3) ... [2019-01-15 17:13:28,637 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 17:13:28,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-15 17:13:28,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-15 17:13:28,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-15 17:13:28,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-15 17:13:28,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-15 17:13:28,707 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-15 17:13:28,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-15 17:13:28,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-15 17:13:28,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-15 17:13:28,707 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-15 17:13:28,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-15 17:13:28,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-15 17:13:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-01-15 17:13:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-15 17:13:28,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:28,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:28,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1181812210, now seen corresponding path program 1 times [2019-01-15 17:13:28,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:28,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:28,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:28,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:29,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:29,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 17:13:29,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:29,460 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-01-15 17:13:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:29,662 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2019-01-15 17:13:29,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:29,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-15 17:13:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:29,680 INFO L225 Difference]: With dead ends: 375 [2019-01-15 17:13:29,681 INFO L226 Difference]: Without dead ends: 225 [2019-01-15 17:13:29,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-15 17:13:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2019-01-15 17:13:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-15 17:13:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2019-01-15 17:13:29,765 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 33 [2019-01-15 17:13:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:29,766 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2019-01-15 17:13:29,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2019-01-15 17:13:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-15 17:13:29,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:29,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:29,770 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash 997420479, now seen corresponding path program 1 times [2019-01-15 17:13:29,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:29,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:29,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:30,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:30,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 17:13:30,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:30,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:30,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:30,076 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand 3 states. [2019-01-15 17:13:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:30,449 INFO L93 Difference]: Finished difference Result 554 states and 821 transitions. [2019-01-15 17:13:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:30,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-15 17:13:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:30,541 INFO L225 Difference]: With dead ends: 554 [2019-01-15 17:13:30,541 INFO L226 Difference]: Without dead ends: 367 [2019-01-15 17:13:30,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-01-15 17:13:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-01-15 17:13:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-15 17:13:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 538 transitions. [2019-01-15 17:13:30,611 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 538 transitions. Word has length 36 [2019-01-15 17:13:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:30,613 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 538 transitions. [2019-01-15 17:13:30,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 538 transitions. [2019-01-15 17:13:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-15 17:13:30,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:30,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:30,621 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1155769398, now seen corresponding path program 1 times [2019-01-15 17:13:30,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:30,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:30,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 17:13:30,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:30,868 INFO L87 Difference]: Start difference. First operand 363 states and 538 transitions. Second operand 3 states. [2019-01-15 17:13:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:31,040 INFO L93 Difference]: Finished difference Result 387 states and 560 transitions. [2019-01-15 17:13:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:31,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-15 17:13:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:31,046 INFO L225 Difference]: With dead ends: 387 [2019-01-15 17:13:31,047 INFO L226 Difference]: Without dead ends: 375 [2019-01-15 17:13:31,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-15 17:13:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-01-15 17:13:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-15 17:13:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 537 transitions. [2019-01-15 17:13:31,089 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 537 transitions. Word has length 44 [2019-01-15 17:13:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:31,090 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 537 transitions. [2019-01-15 17:13:31,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 537 transitions. [2019-01-15 17:13:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-15 17:13:31,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:31,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:31,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1155709816, now seen corresponding path program 1 times [2019-01-15 17:13:31,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:31,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 17:13:31,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:31,411 INFO L87 Difference]: Start difference. First operand 363 states and 537 transitions. Second operand 3 states. [2019-01-15 17:13:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:31,435 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2019-01-15 17:13:31,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:31,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-15 17:13:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:31,440 INFO L225 Difference]: With dead ends: 363 [2019-01-15 17:13:31,440 INFO L226 Difference]: Without dead ends: 361 [2019-01-15 17:13:31,441 INFO L631 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-01-15 17:13:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-01-15 17:13:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-01-15 17:13:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-15 17:13:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2019-01-15 17:13:31,460 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 44 [2019-01-15 17:13:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2019-01-15 17:13:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2019-01-15 17:13:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-15 17:13:31,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:31,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:31,462 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1467259403, now seen corresponding path program 1 times [2019-01-15 17:13:31,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:31,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:31,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 17:13:31,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:31,697 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand 3 states. [2019-01-15 17:13:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:31,720 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2019-01-15 17:13:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:31,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-15 17:13:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:31,723 INFO L225 Difference]: With dead ends: 361 [2019-01-15 17:13:31,723 INFO L226 Difference]: Without dead ends: 359 [2019-01-15 17:13:31,724 INFO L631 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-01-15 17:13:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-15 17:13:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2019-01-15 17:13:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-15 17:13:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2019-01-15 17:13:31,738 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 45 [2019-01-15 17:13:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:31,738 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2019-01-15 17:13:31,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2019-01-15 17:13:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-15 17:13:31,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:31,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:31,740 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1759605298, now seen corresponding path program 1 times [2019-01-15 17:13:31,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 17:13:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:31,962 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand 3 states. [2019-01-15 17:13:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:31,989 INFO L93 Difference]: Finished difference Result 359 states and 533 transitions. [2019-01-15 17:13:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:31,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-15 17:13:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:31,993 INFO L225 Difference]: With dead ends: 359 [2019-01-15 17:13:31,993 INFO L226 Difference]: Without dead ends: 357 [2019-01-15 17:13:31,993 INFO L631 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-01-15 17:13:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-15 17:13:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-01-15 17:13:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-15 17:13:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2019-01-15 17:13:32,008 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 46 [2019-01-15 17:13:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:32,008 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2019-01-15 17:13:32,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2019-01-15 17:13:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-15 17:13:32,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:32,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:32,016 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1286804065, now seen corresponding path program 1 times [2019-01-15 17:13:32,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:32,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:32,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 17:13:32,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:32,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 17:13:32,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:32,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:32,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:32,255 INFO L87 Difference]: Start difference. First operand 357 states and 531 transitions. Second operand 3 states. [2019-01-15 17:13:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:32,429 INFO L93 Difference]: Finished difference Result 1013 states and 1523 transitions. [2019-01-15 17:13:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:32,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-15 17:13:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:32,441 INFO L225 Difference]: With dead ends: 1013 [2019-01-15 17:13:32,441 INFO L226 Difference]: Without dead ends: 674 [2019-01-15 17:13:32,443 INFO L631 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-01-15 17:13:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-01-15 17:13:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 669. [2019-01-15 17:13:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-01-15 17:13:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1005 transitions. [2019-01-15 17:13:32,473 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1005 transitions. Word has length 47 [2019-01-15 17:13:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:32,473 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 1005 transitions. [2019-01-15 17:13:32,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1005 transitions. [2019-01-15 17:13:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-15 17:13:32,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:32,475 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:32,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1630394778, now seen corresponding path program 1 times [2019-01-15 17:13:32,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:32,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 17:13:32,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:32,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 17:13:32,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 17:13:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 17:13:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:32,648 INFO L87 Difference]: Start difference. First operand 669 states and 1005 transitions. Second operand 3 states. [2019-01-15 17:13:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:32,864 INFO L93 Difference]: Finished difference Result 1314 states and 1979 transitions. [2019-01-15 17:13:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 17:13:32,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-15 17:13:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:32,869 INFO L225 Difference]: With dead ends: 1314 [2019-01-15 17:13:32,869 INFO L226 Difference]: Without dead ends: 669 [2019-01-15 17:13:32,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 17:13:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-01-15 17:13:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-01-15 17:13:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-01-15 17:13:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1000 transitions. [2019-01-15 17:13:32,903 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1000 transitions. Word has length 59 [2019-01-15 17:13:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:32,904 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 1000 transitions. [2019-01-15 17:13:32,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 17:13:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1000 transitions. [2019-01-15 17:13:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-15 17:13:32,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:32,905 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:32,906 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:32,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2054373473, now seen corresponding path program 1 times [2019-01-15 17:13:32,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 17:13:33,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:33,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-15 17:13:33,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-15 17:13:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-15 17:13:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-15 17:13:33,602 INFO L87 Difference]: Start difference. First operand 668 states and 1000 transitions. Second operand 7 states. [2019-01-15 17:13:34,327 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:34,579 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-15 17:13:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:34,987 INFO L93 Difference]: Finished difference Result 2516 states and 3819 transitions. [2019-01-15 17:13:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-15 17:13:34,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-01-15 17:13:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:34,999 INFO L225 Difference]: With dead ends: 2516 [2019-01-15 17:13:34,999 INFO L226 Difference]: Without dead ends: 1872 [2019-01-15 17:13:35,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-15 17:13:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-01-15 17:13:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 669. [2019-01-15 17:13:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-01-15 17:13:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1000 transitions. [2019-01-15 17:13:35,074 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1000 transitions. Word has length 60 [2019-01-15 17:13:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:35,074 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 1000 transitions. [2019-01-15 17:13:35,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-15 17:13:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1000 transitions. [2019-01-15 17:13:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-15 17:13:35,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 17:13:35,076 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 17:13:35,076 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 17:13:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 17:13:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -594839262, now seen corresponding path program 1 times [2019-01-15 17:13:35,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 17:13:35,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 17:13:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 17:13:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 17:13:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 17:13:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 17:13:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 17:13:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 17:13:35,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 17:13:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 17:13:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 17:13:35,555 INFO L87 Difference]: Start difference. First operand 669 states and 1000 transitions. Second operand 5 states. [2019-01-15 17:13:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 17:13:36,061 INFO L93 Difference]: Finished difference Result 958 states and 1447 transitions. [2019-01-15 17:13:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 17:13:36,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-15 17:13:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 17:13:36,062 INFO L225 Difference]: With dead ends: 958 [2019-01-15 17:13:36,063 INFO L226 Difference]: Without dead ends: 0 [2019-01-15 17:13:36,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 17:13:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-15 17:13:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-15 17:13:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-15 17:13:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-15 17:13:36,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-01-15 17:13:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 17:13:36,065 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-15 17:13:36,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 17:13:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-15 17:13:36,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-15 17:13:36,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-15 17:13:36,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 17:13:36,670 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:36,812 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:37,035 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:37,319 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-15 17:13:37,489 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:37,671 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-15 17:13:38,638 INFO L451 ceAbstractionStarter]: At program point L6972(lines 6957 6978) the Hoare annotation is: true [2019-01-15 17:13:38,638 INFO L444 ceAbstractionStarter]: At program point L5948(lines 5943 5950) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,639 INFO L448 ceAbstractionStarter]: For program point L6180(lines 6180 6195) no Hoare annotation was computed. [2019-01-15 17:13:38,639 INFO L444 ceAbstractionStarter]: At program point L6313(lines 6302 6315) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,639 INFO L448 ceAbstractionStarter]: For program point L6115(line 6115) no Hoare annotation was computed. [2019-01-15 17:13:38,639 INFO L444 ceAbstractionStarter]: At program point L6148(lines 6960 6963) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,639 INFO L448 ceAbstractionStarter]: For program point L6941(lines 6941 6947) no Hoare annotation was computed. [2019-01-15 17:13:38,639 INFO L444 ceAbstractionStarter]: At program point L5752-1(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,639 INFO L444 ceAbstractionStarter]: At program point L5752-2(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,642 INFO L444 ceAbstractionStarter]: At program point L5752(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,643 INFO L444 ceAbstractionStarter]: At program point L5752-5(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,643 INFO L444 ceAbstractionStarter]: At program point L5752-6(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,643 INFO L444 ceAbstractionStarter]: At program point L5752-3(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,643 INFO L444 ceAbstractionStarter]: At program point L5752-4(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,643 INFO L448 ceAbstractionStarter]: For program point L6215(line 6215) no Hoare annotation was computed. [2019-01-15 17:13:38,644 INFO L448 ceAbstractionStarter]: For program point L6182(lines 6182 6192) no Hoare annotation was computed. [2019-01-15 17:13:38,644 INFO L444 ceAbstractionStarter]: At program point L7008(lines 7007 7009) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_retval_3~0 0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-01-15 17:13:38,644 INFO L448 ceAbstractionStarter]: For program point L6183(line 6183) no Hoare annotation was computed. [2019-01-15 17:13:38,644 INFO L448 ceAbstractionStarter]: For program point L6184(lines 6184 6188) no Hoare annotation was computed. [2019-01-15 17:13:38,644 INFO L448 ceAbstractionStarter]: For program point L6052(line 6052) no Hoare annotation was computed. [2019-01-15 17:13:38,644 INFO L444 ceAbstractionStarter]: At program point L6218(lines 5997 6223) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,644 INFO L444 ceAbstractionStarter]: At program point L7011-1(lines 7010 7012) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,644 INFO L444 ceAbstractionStarter]: At program point L7011(lines 7010 7012) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,644 INFO L448 ceAbstractionStarter]: For program point L6912-1(lines 6912 6915) no Hoare annotation was computed. [2019-01-15 17:13:38,645 INFO L448 ceAbstractionStarter]: For program point L6912(lines 6912 6915) no Hoare annotation was computed. [2019-01-15 17:13:38,645 INFO L444 ceAbstractionStarter]: At program point L6946(lines 6935 6949) the Hoare annotation is: (let ((.cse0 (= ~ldv_mutex_mutex_of_device~0 1)) (.cse1 (= ~ldv_retval_3~0 0)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_i_mutex_of_inode~0 1))) (or (and .cse0 (= ~ldv_mutex_udev~0 1) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse1 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) .cse2 .cse3 (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) (and (= ~ldv_mutex_udev~0 2) .cse0 .cse1 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) .cse2 .cse3))) [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790-3(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790-4(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790-1(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790-2(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,645 INFO L451 ceAbstractionStarter]: At program point L5790-7(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,646 INFO L451 ceAbstractionStarter]: At program point L5790-8(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,651 INFO L451 ceAbstractionStarter]: At program point L5790-5(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,651 INFO L451 ceAbstractionStarter]: At program point L5790-6(lines 5789 5792) the Hoare annotation is: true [2019-01-15 17:13:38,651 INFO L448 ceAbstractionStarter]: For program point L6154(line 6154) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6022(lines 6022 6217) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6088(line 6088) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L444 ceAbstractionStarter]: At program point L6980(lines 6979 6981) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_retval_3~0 0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6122(line 6122) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6023(line 6023) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6089(lines 6089 6093) no Hoare annotation was computed. [2019-01-15 17:13:38,652 INFO L451 ceAbstractionStarter]: At program point L6222(lines 5974 6224) the Hoare annotation is: true [2019-01-15 17:13:38,652 INFO L444 ceAbstractionStarter]: At program point L6321(lines 1 7032) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,652 INFO L448 ceAbstractionStarter]: For program point L6123(lines 6123 6159) no Hoare annotation was computed. [2019-01-15 17:13:38,653 INFO L444 ceAbstractionStarter]: At program point L7015(lines 7014 7016) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,653 INFO L448 ceAbstractionStarter]: For program point L6024(lines 6024 6039) no Hoare annotation was computed. [2019-01-15 17:13:38,653 INFO L444 ceAbstractionStarter]: At program point L5760(lines 5755 5762) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,653 INFO L448 ceAbstractionStarter]: For program point L6190(line 6190) no Hoare annotation was computed. [2019-01-15 17:13:38,653 INFO L444 ceAbstractionStarter]: At program point L6983(lines 6982 6984) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,653 INFO L448 ceAbstractionStarter]: For program point L6851-1(lines 6851 6854) no Hoare annotation was computed. [2019-01-15 17:13:38,653 INFO L448 ceAbstractionStarter]: For program point L6851(lines 6851 6854) no Hoare annotation was computed. [2019-01-15 17:13:38,653 INFO L444 ceAbstractionStarter]: At program point L6917(lines 1 7032) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,654 INFO L448 ceAbstractionStarter]: For program point L6059(line 6059) no Hoare annotation was computed. [2019-01-15 17:13:38,654 INFO L448 ceAbstractionStarter]: For program point L6026(lines 6026 6036) no Hoare annotation was computed. [2019-01-15 17:13:38,656 INFO L448 ceAbstractionStarter]: For program point L6125(lines 6125 6156) no Hoare annotation was computed. [2019-01-15 17:13:38,656 INFO L444 ceAbstractionStarter]: At program point L6291(lines 6286 6293) the Hoare annotation is: (let ((.cse0 (= ~ldv_mutex_mutex_of_device~0 1)) (.cse1 (= ~ldv_retval_3~0 0)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_i_mutex_of_inode~0 1))) (or (and (= ~ldv_mutex_udev~0 2) .cse0 .cse1 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) .cse2 .cse3 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) (and (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) .cse0 (= ~ldv_mutex_udev~0 1) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse1 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) .cse2 .cse3 (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-01-15 17:13:38,656 INFO L448 ceAbstractionStarter]: For program point L6126(line 6126) no Hoare annotation was computed. [2019-01-15 17:13:38,656 INFO L448 ceAbstractionStarter]: For program point L6027(line 6027) no Hoare annotation was computed. [2019-01-15 17:13:38,656 INFO L448 ceAbstractionStarter]: For program point L6060(lines 6060 6120) no Hoare annotation was computed. [2019-01-15 17:13:38,656 INFO L448 ceAbstractionStarter]: For program point L6127(lines 6127 6132) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L444 ceAbstractionStarter]: At program point L7019(lines 7018 7020) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point L6028(lines 6028 6032) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point L6095(line 6095) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point L6062(lines 6062 6117) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point L6161(line 6161) no Hoare annotation was computed. [2019-01-15 17:13:38,657 INFO L444 ceAbstractionStarter]: At program point L6987(lines 6986 6988) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,657 INFO L448 ceAbstractionStarter]: For program point L6327-1(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,658 INFO L448 ceAbstractionStarter]: For program point L6327(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,658 INFO L448 ceAbstractionStarter]: For program point L6327-5(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6162(lines 6162 6177) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6327-4(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6327-3(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6327-2(line 6327) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6063(line 6063) no Hoare annotation was computed. [2019-01-15 17:13:38,661 INFO L448 ceAbstractionStarter]: For program point L6096(lines 6096 6103) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L444 ceAbstractionStarter]: At program point L6856(lines 6848 6858) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,662 INFO L448 ceAbstractionStarter]: For program point L6064(lines 6064 6072) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L448 ceAbstractionStarter]: For program point L6098(lines 6098 6101) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L448 ceAbstractionStarter]: For program point L6197(line 6197) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L448 ceAbstractionStarter]: For program point L6164(lines 6164 6174) no Hoare annotation was computed. [2019-01-15 17:13:38,662 INFO L444 ceAbstractionStarter]: At program point L7023(lines 7022 7024) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,662 INFO L444 ceAbstractionStarter]: At program point L5768-1(lines 5763 5770) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,662 INFO L444 ceAbstractionStarter]: At program point L5768(lines 5763 5770) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,663 INFO L448 ceAbstractionStarter]: For program point L6198(lines 6198 6213) no Hoare annotation was computed. [2019-01-15 17:13:38,663 INFO L448 ceAbstractionStarter]: For program point L6066(lines 6066 6070) no Hoare annotation was computed. [2019-01-15 17:13:38,667 INFO L448 ceAbstractionStarter]: For program point L6165(line 6165) no Hoare annotation was computed. [2019-01-15 17:13:38,667 INFO L444 ceAbstractionStarter]: At program point L5835(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,667 INFO L444 ceAbstractionStarter]: At program point L5835-1(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,667 INFO L444 ceAbstractionStarter]: At program point L5835-2(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,667 INFO L444 ceAbstractionStarter]: At program point L5835-3(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6166(lines 6166 6170) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6034(line 6034) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6134(line 6134) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6200(lines 6200 6210) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6960(lines 6959 6977) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6135(lines 6135 6152) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point L6201(line 6201) no Hoare annotation was computed. [2019-01-15 17:13:38,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6202(lines 6202 6206) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L444 ceAbstractionStarter]: At program point L5971(lines 5965 5973) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6137-2(lines 6135 6151) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6137(lines 6137 6145) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6105(line 6105) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6964(lines 6959 6977) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6106(lines 6106 6113) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,669 INFO L448 ceAbstractionStarter]: For program point L6172(line 6172) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6338(lines 6338 6341) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6338-1(lines 6338 6341) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6074(line 6074) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6041(line 6041) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6075(lines 6075 6080) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6042(lines 6042 6057) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L448 ceAbstractionStarter]: For program point L6075-2(lines 6062 6117) no Hoare annotation was computed. [2019-01-15 17:13:38,670 INFO L444 ceAbstractionStarter]: At program point L7000(lines 6999 7001) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,671 INFO L448 ceAbstractionStarter]: For program point L6208(line 6208) no Hoare annotation was computed. [2019-01-15 17:13:38,676 INFO L448 ceAbstractionStarter]: For program point L6968(lines 6959 6977) no Hoare annotation was computed. [2019-01-15 17:13:38,676 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,676 INFO L444 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,676 INFO L448 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,676 INFO L444 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,676 INFO L448 ceAbstractionStarter]: For program point L6044(lines 6044 6054) no Hoare annotation was computed. [2019-01-15 17:13:38,676 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,677 INFO L444 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,677 INFO L448 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,677 INFO L444 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,677 INFO L448 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,677 INFO L444 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,677 INFO L448 ceAbstractionStarter]: For program point L-1-15(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,677 INFO L444 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,677 INFO L448 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,677 INFO L444 ceAbstractionStarter]: At program point L-1-20(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-15 17:13:38,678 INFO L448 ceAbstractionStarter]: For program point L-1-21(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,678 INFO L444 ceAbstractionStarter]: At program point L6342(lines 6331 6344) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-01-15 17:13:38,678 INFO L444 ceAbstractionStarter]: At program point L-1-23(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,678 INFO L448 ceAbstractionStarter]: For program point L-1-24(line -1) no Hoare annotation was computed. [2019-01-15 17:13:38,678 INFO L448 ceAbstractionStarter]: For program point L6045(line 6045) no Hoare annotation was computed. [2019-01-15 17:13:38,678 INFO L448 ceAbstractionStarter]: For program point L5847(lines 5847 5850) no Hoare annotation was computed. [2019-01-15 17:13:38,678 INFO L448 ceAbstractionStarter]: For program point L6046(lines 6046 6050) no Hoare annotation was computed. [2019-01-15 17:13:38,678 INFO L444 ceAbstractionStarter]: At program point L7004(lines 7003 7005) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_retval_3~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-15 17:13:38,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-15 17:13:38,679 INFO L448 ceAbstractionStarter]: For program point L6179(line 6179) no Hoare annotation was computed. [2019-01-15 17:13:38,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 05:13:38 BoogieIcfgContainer [2019-01-15 17:13:38,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-15 17:13:38,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-15 17:13:38,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-15 17:13:38,730 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-15 17:13:38,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 05:13:28" (3/4) ... [2019-01-15 17:13:38,736 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-15 17:13:38,766 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2019-01-15 17:13:38,769 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-15 17:13:38,772 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-15 17:13:38,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) || (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) [2019-01-15 17:13:38,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result) || ((((((((\result + 1 <= 0 && ldv_mutex_mutex_of_device == 1) && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) [2019-01-15 17:13:38,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0 [2019-01-15 17:13:38,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result [2019-01-15 17:13:38,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result [2019-01-15 17:13:39,154 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-15 17:13:39,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-15 17:13:39,155 INFO L168 Benchmark]: Toolchain (without parser) took 16390.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 937.8 MB in the beginning and 856.8 MB in the end (delta: 81.0 MB). Peak memory consumption was 352.1 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,156 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 17:13:39,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2120.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 937.8 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,159 INFO L168 Benchmark]: Boogie Preprocessor took 171.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,160 INFO L168 Benchmark]: RCFGBuilder took 3362.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 854.7 MB in the end (delta: 167.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,160 INFO L168 Benchmark]: TraceAbstraction took 10098.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 854.7 MB in the beginning and 1.0 GB in the end (delta: -176.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 17:13:39,160 INFO L168 Benchmark]: Witness Printer took 425.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 856.8 MB in the end (delta: 174.7 MB). Peak memory consumption was 174.7 MB. Max. memory is 11.5 GB. [2019-01-15 17:13:39,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2120.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 937.8 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 204.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3362.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 854.7 MB in the end (delta: 167.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10098.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 854.7 MB in the beginning and 1.0 GB in the end (delta: -176.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 425.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 856.8 MB in the end (delta: 174.7 MB). Peak memory consumption was 174.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6328]: 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: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6960]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5755]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7003]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6331]: Loop Invariant Derived loop invariant: (((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6302]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 6286]: Loop Invariant Derived loop invariant: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result) || ((((((((\result + 1 <= 0 && ldv_mutex_mutex_of_device == 1) && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7014]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7018]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7007]: Loop Invariant Derived loop invariant: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result - InvariantResult [Line: 5997]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6935]: Loop Invariant Derived loop invariant: (((((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_retval_3 == 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) || (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5943]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7022]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6982]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6986]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6979]: Loop Invariant Derived loop invariant: ((((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5965]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 6848]: Loop Invariant Derived loop invariant: (((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_retval_3 == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 6 error locations. SAFE Result, 9.9s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2431 SDtfs, 2759 SDslu, 2935 SDs, 0 SdLazy, 93 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1239 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 55 PreInvPairs, 214 NumberOfFragments, 881 HoareAnnotationTreeSize, 55 FomulaSimplifications, 11722 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 55 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 41675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...