./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan --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 Taipan --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-cad4683 [2019-10-22 11:26:07,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:07,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:07,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:07,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:07,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:07,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:07,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:07,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:07,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:07,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:07,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:07,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:07,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:07,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:07,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:07,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:07,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:07,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:07,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:07,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:07,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:07,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:07,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:07,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:07,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:07,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:07,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:07,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:07,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:07,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:07,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:07,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:07,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:07,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:07,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:07,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:07,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:07,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:07,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:07,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:07,595 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-10-22 11:26:07,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:07,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:07,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:07,613 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:07,613 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:07,613 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:07,613 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:07,613 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:07,613 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:07,614 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:07,614 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:07,614 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:07,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:07,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:07,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:07,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:07,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:07,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:07,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:07,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:07,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:07,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:07,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:07,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:07,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:07,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:07,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:07,618 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-10-22 11:26:07,619 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan 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 -> Taipan 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-10-22 11:26:07,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:07,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:07,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:07,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:07,664 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:07,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-10-22 11:26:07,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/data/5fe347d47/fff2561453264c24abc2ecc3779ca197/FLAGcb40b10a6 [2019-10-22 11:26:08,301 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:08,302 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-10-22 11:26:08,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/data/5fe347d47/fff2561453264c24abc2ecc3779ca197/FLAGcb40b10a6 [2019-10-22 11:26:08,489 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/data/5fe347d47/fff2561453264c24abc2ecc3779ca197 [2019-10-22 11:26:08,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:08,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:08,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:08,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:08,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:08,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:08" (1/1) ... [2019-10-22 11:26:08,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d4381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:08, skipping insertion in model container [2019-10-22 11:26:08,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:08" (1/1) ... [2019-10-22 11:26:08,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:08,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:09,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:09,712 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:09,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:09,986 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:09,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09 WrapperNode [2019-10-22 11:26:09,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:09,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:09,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:09,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:09,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:10,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:10,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:10,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:10,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:10,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:10,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:10,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:10,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/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-10-22 11:26:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:26:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:26:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:10,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:11,661 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:11,661 INFO L284 CfgBuilder]: Removed 127 assume(true) statements. [2019-10-22 11:26:11,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:11 BoogieIcfgContainer [2019-10-22 11:26:11,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:11,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:11,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:11,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:11,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:08" (1/3) ... [2019-10-22 11:26:11,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e4a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:11, skipping insertion in model container [2019-10-22 11:26:11,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (2/3) ... [2019-10-22 11:26:11,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e4a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:11, skipping insertion in model container [2019-10-22 11:26:11,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:11" (3/3) ... [2019-10-22 11:26:11,674 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-10-22 11:26:11,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:11,693 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:26:11,703 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:26:11,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:11,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:11,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:11,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:11,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:11,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:11,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:11,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-10-22 11:26:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:26:11,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:11,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1181812210, now seen corresponding path program 1 times [2019-10-22 11:26:11,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499250834] [2019-10-22 11:26:11,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:12,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499250834] [2019-10-22 11:26:12,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:12,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355540995] [2019-10-22 11:26:12,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:12,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,376 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-10-22 11:26:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,467 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2019-10-22 11:26:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:12,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:26:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,480 INFO L225 Difference]: With dead ends: 375 [2019-10-22 11:26:12,483 INFO L226 Difference]: Without dead ends: 225 [2019-10-22 11:26:12,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-22 11:26:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2019-10-22 11:26:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-22 11:26:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2019-10-22 11:26:12,543 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 33 [2019-10-22 11:26:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,543 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2019-10-22 11:26:12,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2019-10-22 11:26:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:26:12,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash 997420479, now seen corresponding path program 1 times [2019-10-22 11:26:12,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135028291] [2019-10-22 11:26:12,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:12,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135028291] [2019-10-22 11:26:12,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:12,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561418202] [2019-10-22 11:26:12,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:12,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,706 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand 3 states. [2019-10-22 11:26:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,802 INFO L93 Difference]: Finished difference Result 554 states and 821 transitions. [2019-10-22 11:26:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:12,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:26:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,805 INFO L225 Difference]: With dead ends: 554 [2019-10-22 11:26:12,805 INFO L226 Difference]: Without dead ends: 367 [2019-10-22 11:26:12,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-22 11:26:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-10-22 11:26:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 11:26:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 538 transitions. [2019-10-22 11:26:12,829 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 538 transitions. Word has length 36 [2019-10-22 11:26:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,829 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 538 transitions. [2019-10-22 11:26:12,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 538 transitions. [2019-10-22 11:26:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:26:12,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,831 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1155769398, now seen corresponding path program 1 times [2019-10-22 11:26:12,832 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670217420] [2019-10-22 11:26:12,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:12,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670217420] [2019-10-22 11:26:12,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:12,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28196906] [2019-10-22 11:26:12,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:12,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,961 INFO L87 Difference]: Start difference. First operand 363 states and 538 transitions. Second operand 3 states. [2019-10-22 11:26:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,007 INFO L93 Difference]: Finished difference Result 387 states and 560 transitions. [2019-10-22 11:26:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:26:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,009 INFO L225 Difference]: With dead ends: 387 [2019-10-22 11:26:13,009 INFO L226 Difference]: Without dead ends: 375 [2019-10-22 11:26:13,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-22 11:26:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-10-22 11:26:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 11:26:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 537 transitions. [2019-10-22 11:26:13,025 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 537 transitions. Word has length 44 [2019-10-22 11:26:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,026 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 537 transitions. [2019-10-22 11:26:13,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 537 transitions. [2019-10-22 11:26:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:26:13,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1155709816, now seen corresponding path program 1 times [2019-10-22 11:26:13,028 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184731892] [2019-10-22 11:26:13,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184731892] [2019-10-22 11:26:13,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023282587] [2019-10-22 11:26:13,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,186 INFO L87 Difference]: Start difference. First operand 363 states and 537 transitions. Second operand 3 states. [2019-10-22 11:26:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,195 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2019-10-22 11:26:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:26:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,197 INFO L225 Difference]: With dead ends: 363 [2019-10-22 11:26:13,197 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 11:26:13,198 INFO L600 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-10-22 11:26:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 11:26:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-10-22 11:26:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 11:26:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2019-10-22 11:26:13,211 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 44 [2019-10-22 11:26:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2019-10-22 11:26:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2019-10-22 11:26:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:26:13,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1467259403, now seen corresponding path program 1 times [2019-10-22 11:26:13,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252358697] [2019-10-22 11:26:13,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252358697] [2019-10-22 11:26:13,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906347342] [2019-10-22 11:26:13,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,439 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand 3 states. [2019-10-22 11:26:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,448 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2019-10-22 11:26:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:26:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,451 INFO L225 Difference]: With dead ends: 361 [2019-10-22 11:26:13,451 INFO L226 Difference]: Without dead ends: 359 [2019-10-22 11:26:13,452 INFO L600 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-10-22 11:26:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-10-22 11:26:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2019-10-22 11:26:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-22 11:26:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2019-10-22 11:26:13,466 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 45 [2019-10-22 11:26:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,468 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2019-10-22 11:26:13,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2019-10-22 11:26:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:26:13,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,470 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1759605298, now seen corresponding path program 1 times [2019-10-22 11:26:13,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179132639] [2019-10-22 11:26:13,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179132639] [2019-10-22 11:26:13,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095534654] [2019-10-22 11:26:13,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,654 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand 3 states. [2019-10-22 11:26:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,665 INFO L93 Difference]: Finished difference Result 359 states and 533 transitions. [2019-10-22 11:26:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-22 11:26:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,667 INFO L225 Difference]: With dead ends: 359 [2019-10-22 11:26:13,668 INFO L226 Difference]: Without dead ends: 357 [2019-10-22 11:26:13,668 INFO L600 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-10-22 11:26:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-10-22 11:26:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-10-22 11:26:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-22 11:26:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2019-10-22 11:26:13,687 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 46 [2019-10-22 11:26:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,687 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2019-10-22 11:26:13,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2019-10-22 11:26:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:26:13,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1286804065, now seen corresponding path program 1 times [2019-10-22 11:26:13,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86820077] [2019-10-22 11:26:13,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86820077] [2019-10-22 11:26:13,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328603889] [2019-10-22 11:26:13,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,857 INFO L87 Difference]: Start difference. First operand 357 states and 531 transitions. Second operand 3 states. [2019-10-22 11:26:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,890 INFO L93 Difference]: Finished difference Result 1013 states and 1523 transitions. [2019-10-22 11:26:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 11:26:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,894 INFO L225 Difference]: With dead ends: 1013 [2019-10-22 11:26:13,894 INFO L226 Difference]: Without dead ends: 674 [2019-10-22 11:26:13,895 INFO L600 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-10-22 11:26:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-22 11:26:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 669. [2019-10-22 11:26:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-22 11:26:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1005 transitions. [2019-10-22 11:26:13,916 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1005 transitions. Word has length 47 [2019-10-22 11:26:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,917 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1005 transitions. [2019-10-22 11:26:13,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1005 transitions. [2019-10-22 11:26:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:26:13,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,918 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,918 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1630394778, now seen corresponding path program 1 times [2019-10-22 11:26:13,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348128277] [2019-10-22 11:26:13,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:14,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348128277] [2019-10-22 11:26:14,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:14,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609701272] [2019-10-22 11:26:14,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,040 INFO L87 Difference]: Start difference. First operand 669 states and 1005 transitions. Second operand 3 states. [2019-10-22 11:26:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,122 INFO L93 Difference]: Finished difference Result 1314 states and 1979 transitions. [2019-10-22 11:26:14,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-22 11:26:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,125 INFO L225 Difference]: With dead ends: 1314 [2019-10-22 11:26:14,125 INFO L226 Difference]: Without dead ends: 669 [2019-10-22 11:26:14,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-22 11:26:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-10-22 11:26:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-10-22 11:26:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1000 transitions. [2019-10-22 11:26:14,144 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1000 transitions. Word has length 59 [2019-10-22 11:26:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,144 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 1000 transitions. [2019-10-22 11:26:14,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1000 transitions. [2019-10-22 11:26:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 11:26:14,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,146 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,146 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2054373473, now seen corresponding path program 1 times [2019-10-22 11:26:14,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016878082] [2019-10-22 11:26:14,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:14,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016878082] [2019-10-22 11:26:14,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:26:14,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713137664] [2019-10-22 11:26:14,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:26:14,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:26:14,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:14,354 INFO L87 Difference]: Start difference. First operand 668 states and 1000 transitions. Second operand 7 states. [2019-10-22 11:26:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,530 INFO L93 Difference]: Finished difference Result 2516 states and 3819 transitions. [2019-10-22 11:26:14,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:14,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-22 11:26:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,536 INFO L225 Difference]: With dead ends: 2516 [2019-10-22 11:26:14,536 INFO L226 Difference]: Without dead ends: 1872 [2019-10-22 11:26:14,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-10-22 11:26:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 669. [2019-10-22 11:26:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-22 11:26:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1000 transitions. [2019-10-22 11:26:14,581 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1000 transitions. Word has length 60 [2019-10-22 11:26:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,581 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1000 transitions. [2019-10-22 11:26:14,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:26:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1000 transitions. [2019-10-22 11:26:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:26:14,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,585 INFO L380 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-10-22 11:26:14,585 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash -594839262, now seen corresponding path program 1 times [2019-10-22 11:26:14,587 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864396934] [2019-10-22 11:26:14,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:14,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864396934] [2019-10-22 11:26:14,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:14,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611243019] [2019-10-22 11:26:14,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:14,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:14,813 INFO L87 Difference]: Start difference. First operand 669 states and 1000 transitions. Second operand 5 states. [2019-10-22 11:26:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,874 INFO L93 Difference]: Finished difference Result 958 states and 1447 transitions. [2019-10-22 11:26:14,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:14,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:26:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,875 INFO L225 Difference]: With dead ends: 958 [2019-10-22 11:26:14,875 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:14,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:14,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-10-22 11:26:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,878 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:14,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:14,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:14,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:26:15,684 INFO L446 ceAbstractionStarter]: At program point L6972(lines 6957 6978) the Hoare annotation is: true [2019-10-22 11:26:15,684 INFO L439 ceAbstractionStarter]: At program point L5948(lines 5943 5950) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,684 INFO L443 ceAbstractionStarter]: For program point L6180(lines 6180 6195) no Hoare annotation was computed. [2019-10-22 11:26:15,684 INFO L439 ceAbstractionStarter]: At program point L6313(lines 6302 6315) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,684 INFO L443 ceAbstractionStarter]: For program point L6115(line 6115) no Hoare annotation was computed. [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L6148(lines 6960 6963) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-10-22 11:26:15,685 INFO L443 ceAbstractionStarter]: For program point L6941(lines 6941 6947) no Hoare annotation was computed. [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752-1(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752-2(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752-5(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752-6(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,685 INFO L439 ceAbstractionStarter]: At program point L5752-3(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,686 INFO L439 ceAbstractionStarter]: At program point L5752-4(lines 5744 5754) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,686 INFO L443 ceAbstractionStarter]: For program point L6215(line 6215) no Hoare annotation was computed. [2019-10-22 11:26:15,686 INFO L443 ceAbstractionStarter]: For program point L6182(lines 6182 6192) no Hoare annotation was computed. [2019-10-22 11:26:15,686 INFO L439 ceAbstractionStarter]: At program point L7008(lines 7007 7009) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-10-22 11:26:15,686 INFO L443 ceAbstractionStarter]: For program point L6183(line 6183) no Hoare annotation was computed. [2019-10-22 11:26:15,686 INFO L443 ceAbstractionStarter]: For program point L6184(lines 6184 6188) no Hoare annotation was computed. [2019-10-22 11:26:15,686 INFO L443 ceAbstractionStarter]: For program point L6052(line 6052) no Hoare annotation was computed. [2019-10-22 11:26:15,686 INFO L439 ceAbstractionStarter]: At program point L6218(lines 5997 6223) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,686 INFO L439 ceAbstractionStarter]: At program point L7011-1(lines 7010 7012) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,688 INFO L439 ceAbstractionStarter]: At program point L7011(lines 7010 7012) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,688 INFO L443 ceAbstractionStarter]: For program point L6912-1(lines 6912 6915) no Hoare annotation was computed. [2019-10-22 11:26:15,688 INFO L443 ceAbstractionStarter]: For program point L6912(lines 6912 6915) no Hoare annotation was computed. [2019-10-22 11:26:15,688 INFO L439 ceAbstractionStarter]: At program point L6946(lines 6935 6949) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse3 (= ~ldv_retval_3~0 0))) (or (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 .cse3 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)))) [2019-10-22 11:26:15,688 INFO L446 ceAbstractionStarter]: At program point L5790(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,688 INFO L446 ceAbstractionStarter]: At program point L5790-3(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-4(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-1(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-2(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-7(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-8(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-5(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L446 ceAbstractionStarter]: At program point L5790-6(lines 5789 5792) the Hoare annotation is: true [2019-10-22 11:26:15,689 INFO L443 ceAbstractionStarter]: For program point L6154(line 6154) no Hoare annotation was computed. [2019-10-22 11:26:15,689 INFO L443 ceAbstractionStarter]: For program point L6022(lines 6022 6217) no Hoare annotation was computed. [2019-10-22 11:26:15,689 INFO L443 ceAbstractionStarter]: For program point L6088(line 6088) no Hoare annotation was computed. [2019-10-22 11:26:15,690 INFO L439 ceAbstractionStarter]: At program point L6980(lines 6979 6981) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-10-22 11:26:15,690 INFO L443 ceAbstractionStarter]: For program point L6122(line 6122) no Hoare annotation was computed. [2019-10-22 11:26:15,690 INFO L443 ceAbstractionStarter]: For program point L6023(line 6023) no Hoare annotation was computed. [2019-10-22 11:26:15,690 INFO L443 ceAbstractionStarter]: For program point L6089(lines 6089 6093) no Hoare annotation was computed. [2019-10-22 11:26:15,690 INFO L446 ceAbstractionStarter]: At program point L6222(lines 5974 6224) the Hoare annotation is: true [2019-10-22 11:26:15,690 INFO L439 ceAbstractionStarter]: At program point L6321(lines 1 7032) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,690 INFO L443 ceAbstractionStarter]: For program point L6123(lines 6123 6159) no Hoare annotation was computed. [2019-10-22 11:26:15,691 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,691 INFO L439 ceAbstractionStarter]: At program point L7015(lines 7014 7016) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,691 INFO L443 ceAbstractionStarter]: For program point L6024(lines 6024 6039) no Hoare annotation was computed. [2019-10-22 11:26:15,691 INFO L439 ceAbstractionStarter]: At program point L5760(lines 5755 5762) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,691 INFO L443 ceAbstractionStarter]: For program point L6190(line 6190) no Hoare annotation was computed. [2019-10-22 11:26:15,691 INFO L439 ceAbstractionStarter]: At program point L6983(lines 6982 6984) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6851-1(lines 6851 6854) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6851(lines 6851 6854) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L439 ceAbstractionStarter]: At program point L6917(lines 1 7032) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6059(line 6059) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6026(lines 6026 6036) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6125(lines 6125 6156) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L439 ceAbstractionStarter]: At program point L6291(lines 6286 6293) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse3 (= ~ldv_retval_3~0 0))) (or (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 .cse3 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)))) [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6126(line 6126) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6027(line 6027) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6060(lines 6060 6120) no Hoare annotation was computed. [2019-10-22 11:26:15,692 INFO L443 ceAbstractionStarter]: For program point L6127(lines 6127 6132) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L439 ceAbstractionStarter]: At program point L7019(lines 7018 7020) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6028(lines 6028 6032) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6095(line 6095) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6062(lines 6062 6117) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6161(line 6161) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L439 ceAbstractionStarter]: At program point L6987(lines 6986 6988) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6327-1(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,693 INFO L443 ceAbstractionStarter]: For program point L6327(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6327-5(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6162(lines 6162 6177) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6327-4(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6327-3(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6327-2(line 6327) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6063(line 6063) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6096(lines 6096 6103) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L439 ceAbstractionStarter]: At program point L6856(lines 6848 6858) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0) (= 2 ~ldv_mutex_udev~0)) [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point L6064(lines 6064 6072) no Hoare annotation was computed. [2019-10-22 11:26:15,694 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6098(lines 6098 6101) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6197(line 6197) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6164(lines 6164 6174) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L439 ceAbstractionStarter]: At program point L7023(lines 7022 7024) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,695 INFO L439 ceAbstractionStarter]: At program point L5768-1(lines 5763 5770) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,695 INFO L439 ceAbstractionStarter]: At program point L5768(lines 5763 5770) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6198(lines 6198 6213) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6066(lines 6066 6070) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L443 ceAbstractionStarter]: For program point L6165(line 6165) no Hoare annotation was computed. [2019-10-22 11:26:15,695 INFO L439 ceAbstractionStarter]: At program point L5835(lines 5832 5837) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,696 INFO L439 ceAbstractionStarter]: At program point L5835-1(lines 5832 5837) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,696 INFO L439 ceAbstractionStarter]: At program point L5835-2(lines 5832 5837) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,696 INFO L439 ceAbstractionStarter]: At program point L5835-3(lines 5832 5837) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6166(lines 6166 6170) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6034(line 6034) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6134(line 6134) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6200(lines 6200 6210) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6960(lines 6959 6977) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6135(lines 6135 6152) no Hoare annotation was computed. [2019-10-22 11:26:15,696 INFO L443 ceAbstractionStarter]: For program point L6201(line 6201) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6202(lines 6202 6206) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L439 ceAbstractionStarter]: At program point L5971(lines 5965 5973) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6137-2(lines 6135 6151) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6137(lines 6137 6145) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6105(line 6105) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6964(lines 6959 6977) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6106(lines 6106 6113) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6172(line 6172) no Hoare annotation was computed. [2019-10-22 11:26:15,697 INFO L443 ceAbstractionStarter]: For program point L6338(lines 6338 6341) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6338-1(lines 6338 6341) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6074(line 6074) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6041(line 6041) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6075(lines 6075 6080) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6042(lines 6042 6057) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6075-2(lines 6062 6117) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L439 ceAbstractionStarter]: At program point L7000(lines 6999 7001) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6208(line 6208) no Hoare annotation was computed. [2019-10-22 11:26:15,698 INFO L443 ceAbstractionStarter]: For program point L6968(lines 6959 6977) no Hoare annotation was computed. [2019-10-22 11:26:15,703 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,703 INFO L439 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,703 INFO L443 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,703 INFO L439 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,703 INFO L443 ceAbstractionStarter]: For program point L6044(lines 6044 6054) no Hoare annotation was computed. [2019-10-22 11:26:15,703 INFO L443 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,703 INFO L439 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,703 INFO L443 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,704 INFO L443 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,704 INFO L443 ceAbstractionStarter]: For program point L-1-15(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,704 INFO L443 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L-1-20(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,704 INFO L443 ceAbstractionStarter]: For program point L-1-21(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L6342(lines 6331 6344) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-10-22 11:26:15,704 INFO L439 ceAbstractionStarter]: At program point L-1-23(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,704 INFO L443 ceAbstractionStarter]: For program point L-1-24(line -1) no Hoare annotation was computed. [2019-10-22 11:26:15,705 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-10-22 11:26:15,705 INFO L443 ceAbstractionStarter]: For program point L6045(line 6045) no Hoare annotation was computed. [2019-10-22 11:26:15,705 INFO L443 ceAbstractionStarter]: For program point L5847(lines 5847 5850) no Hoare annotation was computed. [2019-10-22 11:26:15,705 INFO L443 ceAbstractionStarter]: For program point L6046(lines 6046 6050) no Hoare annotation was computed. [2019-10-22 11:26:15,705 INFO L439 ceAbstractionStarter]: At program point L7004(lines 7003 7005) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_3~0 0)) [2019-10-22 11:26:15,705 INFO L443 ceAbstractionStarter]: For program point L6179(line 6179) no Hoare annotation was computed. [2019-10-22 11:26:15,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:15 BoogieIcfgContainer [2019-10-22 11:26:15,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:15,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:15,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:15,749 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:15,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:11" (3/4) ... [2019-10-22 11:26:15,752 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:15,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2019-10-22 11:26:15,779 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-10-22 11:26:15,780 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:26:15,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0) || (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) [2019-10-22 11:26:15,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && 0 == \result) [2019-10-22 11:26:15,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0 [2019-10-22 11:26:15,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result [2019-10-22 11:26:15,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result [2019-10-22 11:26:16,291 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9b92eb5-9914-4e95-b55e-efac51abf9bd/bin/utaipan/witness.graphml [2019-10-22 11:26:16,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:16,293 INFO L168 Benchmark]: Toolchain (without parser) took 7800.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.9 MB). Free memory was 933.7 MB in the beginning and 1.3 GB in the end (delta: -363.4 MB). Peak memory consumption was 317.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,293 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:16,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1494.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 933.7 MB in the beginning and 1.0 GB in the end (delta: -103.6 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,294 INFO L168 Benchmark]: Boogie Preprocessor took 105.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,294 INFO L168 Benchmark]: RCFGBuilder took 1443.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,294 INFO L168 Benchmark]: TraceAbstraction took 4082.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 99.1 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,295 INFO L168 Benchmark]: Witness Printer took 542.94 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 960.5 MB in the beginning and 1.3 GB in the end (delta: -336.6 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1494.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 933.7 MB in the beginning and 1.0 GB in the end (delta: -103.6 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1443.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4082.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 99.1 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. * Witness Printer took 542.94 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 960.5 MB in the beginning and 1.3 GB in the end (delta: -336.6 MB). Peak memory consumption was 120.3 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: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - 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: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5755]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 7003]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6331]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - 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: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6286]: Loop Invariant Derived loop invariant: ((((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && 0 == \result) - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7014]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7018]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 7007]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result - InvariantResult [Line: 5997]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6935]: Loop Invariant Derived loop invariant: (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && \result + 1 <= 0) && ret + 1 <= 0) || (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5943]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 7022]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6982]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6986]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6979]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 5965]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0 - InvariantResult [Line: 6848]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && ldv_retval_3 == 0) && 2 == ldv_mutex_udev - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 6 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 2431 SDtfs, 2759 SDslu, 2935 SDs, 0 SdLazy, 93 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1239 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 55 PreInvPairs, 214 NumberOfFragments, 881 HoareAnnotationTreeSize, 55 FomulaSimplifications, 11722 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 55 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...