./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/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/config/AutomizerReach.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/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46c36fd07cc60a39e7730aed0a49b29fd44b0553 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:36:36,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:36:36,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:36:36,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:36:36,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:36:36,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:36:36,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:36:36,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:36:36,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:36:36,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:36:36,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:36:36,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:36:36,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:36:36,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:36:36,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:36:36,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:36:36,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:36:36,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:36:36,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:36:36,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:36:36,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:36:36,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:36:36,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:36:36,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:36:36,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:36:36,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:36:36,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:36:36,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:36:36,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:36:36,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:36:36,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:36:36,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:36:36,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:36:36,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:36:36,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:36:36,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:36:36,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:36:36,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:36:36,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:36:36,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:36:36,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:36:36,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-15 23:36:36,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:36:36,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:36:36,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:36:36,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:36:36,969 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:36:36,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:36:36,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:36:36,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:36:36,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:36:36,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:36:36,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:36:36,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:36:36,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:36:36,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:36:36,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:36:36,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:36:36,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:36:36,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:36:36,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:36,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:36:36,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:36:36,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:36:36,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:36:36,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:36:36,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:36:36,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:36:36,973 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46c36fd07cc60a39e7730aed0a49b29fd44b0553 [2019-11-15 23:36:37,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:36:37,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:36:37,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:36:37,022 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:36:37,023 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:36:37,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/../../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-11-15 23:36:37,082 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/data/ef7cea979/4043d7c43f9b42e78b8ad3d2ea2ecbf7/FLAGfd1844e36 [2019-11-15 23:36:37,744 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:36:37,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/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-11-15 23:36:37,783 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/data/ef7cea979/4043d7c43f9b42e78b8ad3d2ea2ecbf7/FLAGfd1844e36 [2019-11-15 23:36:37,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/data/ef7cea979/4043d7c43f9b42e78b8ad3d2ea2ecbf7 [2019-11-15 23:36:37,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:36:37,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:36:37,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:37,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:36:37,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:36:37,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60133190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37, skipping insertion in model container [2019-11-15 23:36:37,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:36:37,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:36:39,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:39,123 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:36:39,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:39,422 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:36:39,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39 WrapperNode [2019-11-15 23:36:39,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:39,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:39,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:36:39,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:36:39,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:39,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:36:39,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:36:39,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:36:39,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... [2019-11-15 23:36:39,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:36:39,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:36:39,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:36:39,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:36:39,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:36:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:36:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:36:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:36:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:36:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:36:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:36:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:36:39,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:36:41,304 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:36:41,304 INFO L284 CfgBuilder]: Removed 127 assume(true) statements. [2019-11-15 23:36:41,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:41 BoogieIcfgContainer [2019-11-15 23:36:41,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:36:41,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:36:41,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:36:41,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:36:41,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:37" (1/3) ... [2019-11-15 23:36:41,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7ec616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:41, skipping insertion in model container [2019-11-15 23:36:41,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:39" (2/3) ... [2019-11-15 23:36:41,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7ec616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:41, skipping insertion in model container [2019-11-15 23:36:41,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:41" (3/3) ... [2019-11-15 23:36:41,316 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-11-15 23:36:41,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:36:41,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-15 23:36:41,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-15 23:36:41,369 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:36:41,370 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:36:41,370 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:36:41,371 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:36:41,371 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:36:41,371 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:36:41,371 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:36:41,371 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:36:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 23:36:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:36:41,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:41,406 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] [2019-11-15 23:36:41,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1079717372, now seen corresponding path program 1 times [2019-11-15 23:36:41,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327966754] [2019-11-15 23:36:41,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:42,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327966754] [2019-11-15 23:36:42,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:42,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:42,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007628029] [2019-11-15 23:36:42,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:42,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:42,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:42,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:42,101 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-11-15 23:36:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:42,205 INFO L93 Difference]: Finished difference Result 366 states and 539 transitions. [2019-11-15 23:36:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:42,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:36:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:42,229 INFO L225 Difference]: With dead ends: 366 [2019-11-15 23:36:42,229 INFO L226 Difference]: Without dead ends: 217 [2019-11-15 23:36:42,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-15 23:36:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2019-11-15 23:36:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-15 23:36:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-11-15 23:36:42,307 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 27 [2019-11-15 23:36:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:42,309 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-11-15 23:36:42,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-11-15 23:36:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:36:42,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:42,311 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] [2019-11-15 23:36:42,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -926810451, now seen corresponding path program 1 times [2019-11-15 23:36:42,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045850440] [2019-11-15 23:36:42,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:42,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045850440] [2019-11-15 23:36:42,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:42,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:42,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555490842] [2019-11-15 23:36:42,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:42,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:42,497 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-11-15 23:36:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:42,629 INFO L93 Difference]: Finished difference Result 544 states and 801 transitions. [2019-11-15 23:36:42,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:42,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 23:36:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:42,633 INFO L225 Difference]: With dead ends: 544 [2019-11-15 23:36:42,633 INFO L226 Difference]: Without dead ends: 359 [2019-11-15 23:36:42,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-15 23:36:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-11-15 23:36:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-15 23:36:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 522 transitions. [2019-11-15 23:36:42,665 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 522 transitions. Word has length 30 [2019-11-15 23:36:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:42,666 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 522 transitions. [2019-11-15 23:36:42,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 522 transitions. [2019-11-15 23:36:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:36:42,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:42,672 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] [2019-11-15 23:36:42,673 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash -452402829, now seen corresponding path program 1 times [2019-11-15 23:36:42,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450997513] [2019-11-15 23:36:42,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:42,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450997513] [2019-11-15 23:36:42,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:42,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:36:42,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990404038] [2019-11-15 23:36:42,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:42,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:42,910 INFO L87 Difference]: Start difference. First operand 355 states and 522 transitions. Second operand 3 states. [2019-11-15 23:36:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:42,919 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2019-11-15 23:36:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:42,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-15 23:36:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:42,922 INFO L225 Difference]: With dead ends: 355 [2019-11-15 23:36:42,922 INFO L226 Difference]: Without dead ends: 353 [2019-11-15 23:36:42,922 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-11-15 23:36:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-15 23:36:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-11-15 23:36:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-15 23:36:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2019-11-15 23:36:42,941 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 37 [2019-11-15 23:36:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:42,941 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2019-11-15 23:36:42,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2019-11-15 23:36:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:36:42,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:42,943 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] [2019-11-15 23:36:42,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1139579328, now seen corresponding path program 1 times [2019-11-15 23:36:42,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658408055] [2019-11-15 23:36:42,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658408055] [2019-11-15 23:36:43,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:43,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:36:43,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427726768] [2019-11-15 23:36:43,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:43,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:43,137 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand 3 states. [2019-11-15 23:36:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,146 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2019-11-15 23:36:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:43,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-15 23:36:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,149 INFO L225 Difference]: With dead ends: 353 [2019-11-15 23:36:43,150 INFO L226 Difference]: Without dead ends: 351 [2019-11-15 23:36:43,151 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-11-15 23:36:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-15 23:36:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-11-15 23:36:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-15 23:36:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 518 transitions. [2019-11-15 23:36:43,168 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 518 transitions. Word has length 38 [2019-11-15 23:36:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,168 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 518 transitions. [2019-11-15 23:36:43,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 518 transitions. [2019-11-15 23:36:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:36:43,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:43,171 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] [2019-11-15 23:36:43,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash -967214307, now seen corresponding path program 1 times [2019-11-15 23:36:43,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542888083] [2019-11-15 23:36:43,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542888083] [2019-11-15 23:36:43,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:43,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:36:43,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970190850] [2019-11-15 23:36:43,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:43,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:43,321 INFO L87 Difference]: Start difference. First operand 351 states and 518 transitions. Second operand 3 states. [2019-11-15 23:36:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,331 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-11-15 23:36:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:43,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:36:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,334 INFO L225 Difference]: With dead ends: 351 [2019-11-15 23:36:43,334 INFO L226 Difference]: Without dead ends: 349 [2019-11-15 23:36:43,334 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-11-15 23:36:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-15 23:36:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-11-15 23:36:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-15 23:36:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2019-11-15 23:36:43,346 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 39 [2019-11-15 23:36:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,346 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2019-11-15 23:36:43,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2019-11-15 23:36:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:36:43,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:43,348 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] [2019-11-15 23:36:43,348 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash 81134058, now seen corresponding path program 1 times [2019-11-15 23:36:43,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240969673] [2019-11-15 23:36:43,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240969673] [2019-11-15 23:36:43,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:43,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:36:43,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819936983] [2019-11-15 23:36:43,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:43,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:43,497 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand 3 states. [2019-11-15 23:36:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,531 INFO L93 Difference]: Finished difference Result 1001 states and 1502 transitions. [2019-11-15 23:36:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:43,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-15 23:36:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,536 INFO L225 Difference]: With dead ends: 1001 [2019-11-15 23:36:43,537 INFO L226 Difference]: Without dead ends: 664 [2019-11-15 23:36:43,538 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-11-15 23:36:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-11-15 23:36:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 659. [2019-11-15 23:36:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:36:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 986 transitions. [2019-11-15 23:36:43,560 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 986 transitions. Word has length 40 [2019-11-15 23:36:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,561 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 986 transitions. [2019-11-15 23:36:43,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 986 transitions. [2019-11-15 23:36:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:36:43,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:43,562 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] [2019-11-15 23:36:43,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1376605001, now seen corresponding path program 1 times [2019-11-15 23:36:43,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690129969] [2019-11-15 23:36:43,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:36:43,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690129969] [2019-11-15 23:36:43,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:43,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:43,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819063365] [2019-11-15 23:36:43,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:43,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:43,748 INFO L87 Difference]: Start difference. First operand 659 states and 986 transitions. Second operand 3 states. [2019-11-15 23:36:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:43,846 INFO L93 Difference]: Finished difference Result 1300 states and 1953 transitions. [2019-11-15 23:36:43,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:43,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 23:36:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:43,851 INFO L225 Difference]: With dead ends: 1300 [2019-11-15 23:36:43,851 INFO L226 Difference]: Without dead ends: 659 [2019-11-15 23:36:43,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-15 23:36:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-11-15 23:36:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:36:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 981 transitions. [2019-11-15 23:36:43,875 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 981 transitions. Word has length 52 [2019-11-15 23:36:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:43,875 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 981 transitions. [2019-11-15 23:36:43,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 981 transitions. [2019-11-15 23:36:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:36:43,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:43,877 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] [2019-11-15 23:36:43,877 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921932, now seen corresponding path program 1 times [2019-11-15 23:36:43,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738310981] [2019-11-15 23:36:43,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:36:44,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738310981] [2019-11-15 23:36:44,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:44,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:36:44,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720520395] [2019-11-15 23:36:44,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:36:44,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:36:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:44,113 INFO L87 Difference]: Start difference. First operand 658 states and 981 transitions. Second operand 7 states. [2019-11-15 23:36:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:44,341 INFO L93 Difference]: Finished difference Result 2494 states and 3779 transitions. [2019-11-15 23:36:44,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:36:44,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 23:36:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:44,353 INFO L225 Difference]: With dead ends: 2494 [2019-11-15 23:36:44,353 INFO L226 Difference]: Without dead ends: 1854 [2019-11-15 23:36:44,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:36:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-15 23:36:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 659. [2019-11-15 23:36:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:36:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 981 transitions. [2019-11-15 23:36:44,417 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 981 transitions. Word has length 53 [2019-11-15 23:36:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:44,418 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 981 transitions. [2019-11-15 23:36:44,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:36:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 981 transitions. [2019-11-15 23:36:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:36:44,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:44,488 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] [2019-11-15 23:36:44,488 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash 336433459, now seen corresponding path program 1 times [2019-11-15 23:36:44,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:44,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629083030] [2019-11-15 23:36:44,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:36:44,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629083030] [2019-11-15 23:36:44,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:44,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:44,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205486076] [2019-11-15 23:36:44,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:44,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:44,645 INFO L87 Difference]: Start difference. First operand 659 states and 981 transitions. Second operand 5 states. [2019-11-15 23:36:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:44,727 INFO L93 Difference]: Finished difference Result 946 states and 1424 transitions. [2019-11-15 23:36:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:36:44,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-15 23:36:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:44,728 INFO L225 Difference]: With dead ends: 946 [2019-11-15 23:36:44,728 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:36:44,729 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-11-15 23:36:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:36:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:36:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:36:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:36:44,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-11-15 23:36:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:44,731 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:36:44,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:36:44,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:36:44,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:36:45,669 INFO L446 ceAbstractionStarter]: At program point L6972(lines 6957 6978) the Hoare annotation is: true [2019-11-15 23:36:45,669 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)) [2019-11-15 23:36:45,669 INFO L443 ceAbstractionStarter]: For program point L6180(lines 6180 6195) no Hoare annotation was computed. [2019-11-15 23:36:45,670 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)) [2019-11-15 23:36:45,670 INFO L443 ceAbstractionStarter]: For program point L6115(line 6115) no Hoare annotation was computed. [2019-11-15 23:36:45,670 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-11-15 23:36:45,670 INFO L443 ceAbstractionStarter]: For program point L6941(lines 6941 6947) no Hoare annotation was computed. [2019-11-15 23:36:45,670 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)) [2019-11-15 23:36:45,670 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)) [2019-11-15 23:36:45,671 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)) [2019-11-15 23:36:45,671 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)) [2019-11-15 23:36:45,671 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)) [2019-11-15 23:36:45,671 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)) [2019-11-15 23:36:45,671 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)) [2019-11-15 23:36:45,671 INFO L443 ceAbstractionStarter]: For program point L6215(line 6215) no Hoare annotation was computed. [2019-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point L6182(lines 6182 6192) no Hoare annotation was computed. [2019-11-15 23:36:45,672 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) (= 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-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point L6183(line 6183) no Hoare annotation was computed. [2019-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point L6184(lines 6184 6188) no Hoare annotation was computed. [2019-11-15 23:36:45,672 INFO L443 ceAbstractionStarter]: For program point L6052(line 6052) no Hoare annotation was computed. [2019-11-15 23:36:45,673 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)) [2019-11-15 23:36:45,673 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)) [2019-11-15 23:36:45,673 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)) [2019-11-15 23:36:45,673 INFO L443 ceAbstractionStarter]: For program point L6912-1(lines 6912 6915) no Hoare annotation was computed. [2019-11-15 23:36:45,673 INFO L443 ceAbstractionStarter]: For program point L6912(lines 6912 6915) no Hoare annotation was computed. [2019-11-15 23:36:45,673 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))) (or (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-11-15 23:36:45,673 INFO L446 ceAbstractionStarter]: At program point L5790(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-3(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-4(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-1(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-2(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-7(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-8(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-5(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L446 ceAbstractionStarter]: At program point L5790-6(lines 5789 5792) the Hoare annotation is: true [2019-11-15 23:36:45,674 INFO L443 ceAbstractionStarter]: For program point L6154(line 6154) no Hoare annotation was computed. [2019-11-15 23:36:45,674 INFO L443 ceAbstractionStarter]: For program point L6022(lines 6022 6217) no Hoare annotation was computed. [2019-11-15 23:36:45,674 INFO L443 ceAbstractionStarter]: For program point L6088(line 6088) no Hoare annotation was computed. [2019-11-15 23:36:45,675 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) (= 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-11-15 23:36:45,675 INFO L443 ceAbstractionStarter]: For program point L6122(line 6122) no Hoare annotation was computed. [2019-11-15 23:36:45,675 INFO L443 ceAbstractionStarter]: For program point L6023(line 6023) no Hoare annotation was computed. [2019-11-15 23:36:45,675 INFO L443 ceAbstractionStarter]: For program point L6089(lines 6089 6093) no Hoare annotation was computed. [2019-11-15 23:36:45,675 INFO L446 ceAbstractionStarter]: At program point L6222(lines 5974 6224) the Hoare annotation is: true [2019-11-15 23:36:45,675 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)) [2019-11-15 23:36:45,675 INFO L443 ceAbstractionStarter]: For program point L6123(lines 6123 6159) no Hoare annotation was computed. [2019-11-15 23:36:45,675 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)) [2019-11-15 23:36:45,675 INFO L443 ceAbstractionStarter]: For program point L6024(lines 6024 6039) no Hoare annotation was computed. [2019-11-15 23:36:45,676 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)) [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6190(line 6190) no Hoare annotation was computed. [2019-11-15 23:36:45,676 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)) [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6851-1(lines 6851 6854) no Hoare annotation was computed. [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6851(lines 6851 6854) no Hoare annotation was computed. [2019-11-15 23:36:45,676 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)) [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6059(line 6059) no Hoare annotation was computed. [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6026(lines 6026 6036) no Hoare annotation was computed. [2019-11-15 23:36:45,676 INFO L443 ceAbstractionStarter]: For program point L6125(lines 6125 6156) no Hoare annotation was computed. [2019-11-15 23:36:45,677 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))) (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 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) (and .cse0 .cse1 .cse2 (= 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-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6126(line 6126) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6027(line 6027) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6060(lines 6060 6120) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6127(lines 6127 6132) no Hoare annotation was computed. [2019-11-15 23:36:45,677 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)) [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6028(lines 6028 6032) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6095(line 6095) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6062(lines 6062 6117) no Hoare annotation was computed. [2019-11-15 23:36:45,677 INFO L443 ceAbstractionStarter]: For program point L6161(line 6161) no Hoare annotation was computed. [2019-11-15 23:36:45,679 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)) [2019-11-15 23:36:45,679 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,679 INFO L443 ceAbstractionStarter]: For program point L6327-1(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6327(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6327-5(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6162(lines 6162 6177) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6327-4(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6327-3(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,680 INFO L443 ceAbstractionStarter]: For program point L6327-2(line 6327) no Hoare annotation was computed. [2019-11-15 23:36:45,681 INFO L443 ceAbstractionStarter]: For program point L6063(line 6063) no Hoare annotation was computed. [2019-11-15 23:36:45,681 INFO L443 ceAbstractionStarter]: For program point L6096(lines 6096 6103) no Hoare annotation was computed. [2019-11-15 23:36:45,681 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) (= 2 ~ldv_mutex_udev~0)) [2019-11-15 23:36:45,681 INFO L443 ceAbstractionStarter]: For program point L6064(lines 6064 6072) no Hoare annotation was computed. [2019-11-15 23:36:45,681 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,681 INFO L443 ceAbstractionStarter]: For program point L6098(lines 6098 6101) no Hoare annotation was computed. [2019-11-15 23:36:45,682 INFO L443 ceAbstractionStarter]: For program point L6197(line 6197) no Hoare annotation was computed. [2019-11-15 23:36:45,682 INFO L443 ceAbstractionStarter]: For program point L6164(lines 6164 6174) no Hoare annotation was computed. [2019-11-15 23:36:45,682 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)) [2019-11-15 23:36:45,682 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)) [2019-11-15 23:36:45,682 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)) [2019-11-15 23:36:45,683 INFO L443 ceAbstractionStarter]: For program point L6198(lines 6198 6213) no Hoare annotation was computed. [2019-11-15 23:36:45,683 INFO L443 ceAbstractionStarter]: For program point L6066(lines 6066 6070) no Hoare annotation was computed. [2019-11-15 23:36:45,683 INFO L443 ceAbstractionStarter]: For program point L6165(line 6165) no Hoare annotation was computed. [2019-11-15 23:36:45,683 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)) [2019-11-15 23:36:45,683 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)) [2019-11-15 23:36:45,684 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)) [2019-11-15 23:36:45,684 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)) [2019-11-15 23:36:45,684 INFO L443 ceAbstractionStarter]: For program point L6166(lines 6166 6170) no Hoare annotation was computed. [2019-11-15 23:36:45,684 INFO L443 ceAbstractionStarter]: For program point L6034(line 6034) no Hoare annotation was computed. [2019-11-15 23:36:45,684 INFO L443 ceAbstractionStarter]: For program point L6134(line 6134) no Hoare annotation was computed. [2019-11-15 23:36:45,684 INFO L443 ceAbstractionStarter]: For program point L6200(lines 6200 6210) no Hoare annotation was computed. [2019-11-15 23:36:45,685 INFO L443 ceAbstractionStarter]: For program point L6960(lines 6959 6977) no Hoare annotation was computed. [2019-11-15 23:36:45,685 INFO L443 ceAbstractionStarter]: For program point L6135(lines 6135 6152) no Hoare annotation was computed. [2019-11-15 23:36:45,685 INFO L443 ceAbstractionStarter]: For program point L6201(line 6201) no Hoare annotation was computed. [2019-11-15 23:36:45,685 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,685 INFO L443 ceAbstractionStarter]: For program point L6202(lines 6202 6206) no Hoare annotation was computed. [2019-11-15 23:36:45,685 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)) [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point L6137-2(lines 6135 6151) no Hoare annotation was computed. [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point L6137(lines 6137 6145) no Hoare annotation was computed. [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point L6105(line 6105) no Hoare annotation was computed. [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point L6964(lines 6959 6977) no Hoare annotation was computed. [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,686 INFO L443 ceAbstractionStarter]: For program point L6106(lines 6106 6113) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point L6172(line 6172) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point L6338(lines 6338 6341) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point L6338-1(lines 6338 6341) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point L6074(line 6074) no Hoare annotation was computed. [2019-11-15 23:36:45,687 INFO L443 ceAbstractionStarter]: For program point L6041(line 6041) no Hoare annotation was computed. [2019-11-15 23:36:45,688 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,688 INFO L443 ceAbstractionStarter]: For program point L6075(lines 6075 6080) no Hoare annotation was computed. [2019-11-15 23:36:45,688 INFO L443 ceAbstractionStarter]: For program point L6042(lines 6042 6057) no Hoare annotation was computed. [2019-11-15 23:36:45,688 INFO L443 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2019-11-15 23:36:45,688 INFO L443 ceAbstractionStarter]: For program point L6075-2(lines 6062 6117) no Hoare annotation was computed. [2019-11-15 23:36:45,688 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)) [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L6208(line 6208) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L6968(lines 6959 6977) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,689 INFO L443 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,690 INFO L443 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,690 INFO L443 ceAbstractionStarter]: For program point L6044(lines 6044 6054) no Hoare annotation was computed. [2019-11-15 23:36:45,690 INFO L443 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,690 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)) [2019-11-15 23:36:45,690 INFO L443 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,690 INFO L443 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-11-15 23:36:45,691 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) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-11-15 23:36:45,691 INFO L443 ceAbstractionStarter]: For program point L6045(line 6045) no Hoare annotation was computed. [2019-11-15 23:36:45,691 INFO L443 ceAbstractionStarter]: For program point L5847(lines 5847 5850) no Hoare annotation was computed. [2019-11-15 23:36:45,691 INFO L443 ceAbstractionStarter]: For program point L6046(lines 6046 6050) no Hoare annotation was computed. [2019-11-15 23:36:45,691 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)) [2019-11-15 23:36:45,691 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-11-15 23:36:45,692 INFO L443 ceAbstractionStarter]: For program point L6179(line 6179) no Hoare annotation was computed. [2019-11-15 23:36:45,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:36:45 BoogieIcfgContainer [2019-11-15 23:36:45,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:36:45,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:36:45,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:36:45,720 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:36:45,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:41" (3/4) ... [2019-11-15 23:36:45,723 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:36:45,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2019-11-15 23:36:45,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-15 23:36:45,764 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:36:45,816 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) && 2 == ldv_mutex_udev) && 0 == \result) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) [2019-11-15 23:36:45,817 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) && \result + 1 <= 0) && ret + 1 <= 0) || (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) && 0 == \result) [2019-11-15 23:36:45,817 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) && \result + 1 <= 0) && ret + 1 <= 0 [2019-11-15 23:36:45,818 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) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result [2019-11-15 23:36:45,819 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) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result [2019-11-15 23:36:46,150 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9b1e19c5-5b48-4f3d-b2f2-4f6f417380d3/bin/uautomizer/witness.graphml [2019-11-15 23:36:46,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:36:46,152 INFO L168 Benchmark]: Toolchain (without parser) took 8277.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 939.2 MB in the beginning and 931.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 336.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,153 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:36:46,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1547.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -105.1 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.53 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,154 INFO L168 Benchmark]: Boogie Preprocessor took 138.68 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,155 INFO L168 Benchmark]: RCFGBuilder took 1593.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,155 INFO L168 Benchmark]: TraceAbstraction took 4411.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 832.7 MB in the beginning and 1.1 GB in the end (delta: -272.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:36:46,156 INFO L168 Benchmark]: Witness Printer took 430.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:46,158 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1547.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -105.1 MB). Peak memory consumption was 66.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.53 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.68 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1593.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4411.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 832.7 MB in the beginning and 1.1 GB in the end (delta: -272.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 430.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 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 - 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 - 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 - 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) && 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 - 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 - InvariantResult [Line: 5974]: Loop Invariant Derived loop invariant: 1 - 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 - InvariantResult [Line: 6935]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 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 - 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 - 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 - 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 - 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 - 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 - 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 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - 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 - 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: 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 - 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) && 2 == ldv_mutex_udev) && 0 == \result) && r == 0) && 0 == \result - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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) && \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 - 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 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - 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 - 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 - 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 - 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) && \result + 1 <= 0) && ret + 1 <= 0) || (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) && 0 == \result) - 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 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - 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) && 2 == ldv_mutex_udev - 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 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 6 error locations. Result: SAFE, OverallTime: 4.3s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 2093 SDtfs, 2504 SDslu, 2768 SDs, 0 SdLazy, 88 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=6, 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, 9 MinimizatonAttempts, 1219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 203 NumberOfFragments, 634 HoareAnnotationTreeSize, 48 FomulaSimplifications, 10309 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 29377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...