./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46c36fd07cc60a39e7730aed0a49b29fd44b0553 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 12:47:22,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 12:47:22,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 12:47:22,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 12:47:22,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 12:47:22,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 12:47:22,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 12:47:22,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 12:47:22,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 12:47:22,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 12:47:22,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 12:47:22,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 12:47:22,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 12:47:22,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 12:47:22,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 12:47:22,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 12:47:22,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 12:47:22,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 12:47:22,766 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 12:47:22,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 12:47:22,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 12:47:22,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 12:47:22,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 12:47:22,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 12:47:22,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 12:47:22,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 12:47:22,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 12:47:22,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 12:47:22,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 12:47:22,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 12:47:22,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 12:47:22,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 12:47:22,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 12:47:22,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 12:47:22,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 12:47:22,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 12:47:22,783 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-13 12:47:22,804 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 12:47:22,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 12:47:22,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 12:47:22,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 12:47:22,806 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 12:47:22,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 12:47:22,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 12:47:22,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 12:47:22,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 12:47:22,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 12:47:22,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 12:47:22,809 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 12:47:22,809 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 12:47:22,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 12:47:22,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 12:47:22,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 12:47:22,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 12:47:22,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 12:47:22,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 12:47:22,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 12:47:22,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 12:47:22,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 12:47:22,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 12:47:22,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 12:47:22,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 12:47:22,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-13 12:47:22,814 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46c36fd07cc60a39e7730aed0a49b29fd44b0553 [2019-01-13 12:47:22,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 12:47:22,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 12:47:22,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 12:47:22,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 12:47:22,905 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 12:47:22,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 12:47:22,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa093559/2d0215c978e244f9abd7c5beb5dfad66/FLAG5f692af15 [2019-01-13 12:47:23,681 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 12:47:23,683 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 12:47:23,720 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa093559/2d0215c978e244f9abd7c5beb5dfad66/FLAG5f692af15 [2019-01-13 12:47:23,935 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa093559/2d0215c978e244f9abd7c5beb5dfad66 [2019-01-13 12:47:23,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 12:47:23,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 12:47:23,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 12:47:23,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 12:47:23,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 12:47:23,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 12:47:23" (1/1) ... [2019-01-13 12:47:23,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6516fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:23, skipping insertion in model container [2019-01-13 12:47:23,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 12:47:23" (1/1) ... [2019-01-13 12:47:23,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 12:47:24,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 12:47:25,592 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 12:47:25,649 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 12:47:25,823 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 12:47:25,911 INFO L195 MainTranslator]: Completed translation [2019-01-13 12:47:25,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25 WrapperNode [2019-01-13 12:47:25,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 12:47:25,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 12:47:25,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 12:47:25,913 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 12:47:25,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:25,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 12:47:26,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 12:47:26,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 12:47:26,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 12:47:26,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... [2019-01-13 12:47:26,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 12:47:26,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 12:47:26,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 12:47:26,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 12:47:26,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 12:47:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 12:47:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 12:47:26,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 12:47:26,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 12:47:28,629 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 12:47:28,629 INFO L286 CfgBuilder]: Removed 127 assue(true) statements. [2019-01-13 12:47:28,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 12:47:28 BoogieIcfgContainer [2019-01-13 12:47:28,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 12:47:28,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 12:47:28,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 12:47:28,635 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 12:47:28,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 12:47:23" (1/3) ... [2019-01-13 12:47:28,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5fe6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 12:47:28, skipping insertion in model container [2019-01-13 12:47:28,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 12:47:25" (2/3) ... [2019-01-13 12:47:28,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5fe6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 12:47:28, skipping insertion in model container [2019-01-13 12:47:28,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 12:47:28" (3/3) ... [2019-01-13 12:47:28,638 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 12:47:28,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 12:47:28,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-13 12:47:28,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-13 12:47:28,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 12:47:28,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 12:47:28,704 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 12:47:28,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 12:47:28,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 12:47:28,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 12:47:28,704 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 12:47:28,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 12:47:28,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 12:47:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-01-13 12:47:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 12:47:28,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:28,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:28,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1079717372, now seen corresponding path program 1 times [2019-01-13 12:47:28,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:28,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:29,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:29,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 12:47:29,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:29,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:29,416 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-01-13 12:47:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:29,611 INFO L93 Difference]: Finished difference Result 366 states and 539 transitions. [2019-01-13 12:47:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:29,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-13 12:47:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:29,627 INFO L225 Difference]: With dead ends: 366 [2019-01-13 12:47:29,627 INFO L226 Difference]: Without dead ends: 217 [2019-01-13 12:47:29,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-13 12:47:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2019-01-13 12:47:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-13 12:47:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-01-13 12:47:29,726 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 27 [2019-01-13 12:47:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:29,727 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-01-13 12:47:29,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-01-13 12:47:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 12:47:29,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:29,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:29,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash -926810451, now seen corresponding path program 1 times [2019-01-13 12:47:29,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:29,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 12:47:30,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:30,014 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-01-13 12:47:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:30,341 INFO L93 Difference]: Finished difference Result 544 states and 801 transitions. [2019-01-13 12:47:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:30,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-13 12:47:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:30,348 INFO L225 Difference]: With dead ends: 544 [2019-01-13 12:47:30,353 INFO L226 Difference]: Without dead ends: 359 [2019-01-13 12:47:30,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-13 12:47:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-01-13 12:47:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-01-13 12:47:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 522 transitions. [2019-01-13 12:47:30,409 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 522 transitions. Word has length 30 [2019-01-13 12:47:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:30,410 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 522 transitions. [2019-01-13 12:47:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 522 transitions. [2019-01-13 12:47:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 12:47:30,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:30,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:30,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -452402829, now seen corresponding path program 1 times [2019-01-13 12:47:30,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:30,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:30,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:30,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 12:47:30,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:30,682 INFO L87 Difference]: Start difference. First operand 355 states and 522 transitions. Second operand 3 states. [2019-01-13 12:47:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:30,714 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2019-01-13 12:47:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:30,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-13 12:47:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:30,718 INFO L225 Difference]: With dead ends: 355 [2019-01-13 12:47:30,718 INFO L226 Difference]: Without dead ends: 353 [2019-01-13 12:47:30,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-13 12:47:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-01-13 12:47:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-01-13 12:47:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2019-01-13 12:47:30,755 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 37 [2019-01-13 12:47:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:30,756 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2019-01-13 12:47:30,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2019-01-13 12:47:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 12:47:30,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:30,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:30,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1139579328, now seen corresponding path program 1 times [2019-01-13 12:47:30,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:30,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:30,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:31,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:31,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 12:47:31,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,019 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand 3 states. [2019-01-13 12:47:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:31,042 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2019-01-13 12:47:31,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:31,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-13 12:47:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:31,046 INFO L225 Difference]: With dead ends: 353 [2019-01-13 12:47:31,046 INFO L226 Difference]: Without dead ends: 351 [2019-01-13 12:47:31,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-01-13 12:47:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-01-13 12:47:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-13 12:47:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 518 transitions. [2019-01-13 12:47:31,061 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 518 transitions. Word has length 38 [2019-01-13 12:47:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:31,062 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 518 transitions. [2019-01-13 12:47:31,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 518 transitions. [2019-01-13 12:47:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 12:47:31,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:31,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:31,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash -967214307, now seen corresponding path program 1 times [2019-01-13 12:47:31,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:31,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:31,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 12:47:31,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,297 INFO L87 Difference]: Start difference. First operand 351 states and 518 transitions. Second operand 3 states. [2019-01-13 12:47:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:31,322 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-01-13 12:47:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:31,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-13 12:47:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:31,326 INFO L225 Difference]: With dead ends: 351 [2019-01-13 12:47:31,326 INFO L226 Difference]: Without dead ends: 349 [2019-01-13 12:47:31,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-13 12:47:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-01-13 12:47:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-01-13 12:47:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2019-01-13 12:47:31,343 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 39 [2019-01-13 12:47:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:31,344 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2019-01-13 12:47:31,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2019-01-13 12:47:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 12:47:31,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:31,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:31,348 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash 81134058, now seen corresponding path program 1 times [2019-01-13 12:47:31,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:31,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 12:47:31,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:31,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 12:47:31,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:31,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:31,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,550 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand 3 states. [2019-01-13 12:47:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:31,702 INFO L93 Difference]: Finished difference Result 1001 states and 1502 transitions. [2019-01-13 12:47:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:31,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-13 12:47:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:31,706 INFO L225 Difference]: With dead ends: 1001 [2019-01-13 12:47:31,706 INFO L226 Difference]: Without dead ends: 664 [2019-01-13 12:47:31,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-01-13 12:47:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 659. [2019-01-13 12:47:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-13 12:47:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 986 transitions. [2019-01-13 12:47:31,734 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 986 transitions. Word has length 40 [2019-01-13 12:47:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:31,734 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 986 transitions. [2019-01-13 12:47:31,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 986 transitions. [2019-01-13 12:47:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 12:47:31,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:31,737 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:31,737 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1376605001, now seen corresponding path program 1 times [2019-01-13 12:47:31,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:31,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 12:47:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 12:47:31,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 12:47:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 12:47:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:31,919 INFO L87 Difference]: Start difference. First operand 659 states and 986 transitions. Second operand 3 states. [2019-01-13 12:47:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:32,102 INFO L93 Difference]: Finished difference Result 1300 states and 1953 transitions. [2019-01-13 12:47:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 12:47:32,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 12:47:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:32,106 INFO L225 Difference]: With dead ends: 1300 [2019-01-13 12:47:32,107 INFO L226 Difference]: Without dead ends: 659 [2019-01-13 12:47:32,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 12:47:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-01-13 12:47:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-01-13 12:47:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-01-13 12:47:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 981 transitions. [2019-01-13 12:47:32,133 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 981 transitions. Word has length 52 [2019-01-13 12:47:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:32,133 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 981 transitions. [2019-01-13 12:47:32,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 12:47:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 981 transitions. [2019-01-13 12:47:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 12:47:32,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:32,134 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:32,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921932, now seen corresponding path program 1 times [2019-01-13 12:47:32,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:32,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 12:47:32,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:32,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 12:47:32,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 12:47:32,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 12:47:32,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 12:47:32,716 INFO L87 Difference]: Start difference. First operand 658 states and 981 transitions. Second operand 7 states. [2019-01-13 12:47:33,403 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-13 12:47:33,649 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 12:47:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:34,073 INFO L93 Difference]: Finished difference Result 2494 states and 3779 transitions. [2019-01-13 12:47:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 12:47:34,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-13 12:47:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:34,083 INFO L225 Difference]: With dead ends: 2494 [2019-01-13 12:47:34,083 INFO L226 Difference]: Without dead ends: 1854 [2019-01-13 12:47:34,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-13 12:47:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-01-13 12:47:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 659. [2019-01-13 12:47:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-13 12:47:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 981 transitions. [2019-01-13 12:47:34,152 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 981 transitions. Word has length 53 [2019-01-13 12:47:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:34,155 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 981 transitions. [2019-01-13 12:47:34,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 12:47:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 981 transitions. [2019-01-13 12:47:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 12:47:34,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 12:47:34,157 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 12:47:34,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 12:47:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 12:47:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash 336433459, now seen corresponding path program 1 times [2019-01-13 12:47:34,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 12:47:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 12:47:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 12:47:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 12:47:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 12:47:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 12:47:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 12:47:34,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 12:47:34,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 12:47:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 12:47:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 12:47:34,519 INFO L87 Difference]: Start difference. First operand 659 states and 981 transitions. Second operand 5 states. [2019-01-13 12:47:34,897 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-13 12:47:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 12:47:35,017 INFO L93 Difference]: Finished difference Result 946 states and 1424 transitions. [2019-01-13 12:47:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 12:47:35,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-13 12:47:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 12:47:35,019 INFO L225 Difference]: With dead ends: 946 [2019-01-13 12:47:35,019 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 12:47:35,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 12:47:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 12:47:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 12:47:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 12:47:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 12:47:35,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-01-13 12:47:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 12:47:35,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 12:47:35,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 12:47:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 12:47:35,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 12:47:35,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-13 12:47:35,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 12:47:35,561 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 12:47:35,678 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 12:47:35,825 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 12:47:36,020 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 12:47:36,535 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-13 12:47:36,670 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-13 12:47:37,233 INFO L451 ceAbstractionStarter]: At program point L6972(lines 6957 6978) the Hoare annotation is: true [2019-01-13 12:47:37,233 INFO L444 ceAbstractionStarter]: At program point L5948(lines 5943 5950) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-13 12:47:37,233 INFO L448 ceAbstractionStarter]: For program point L6180(lines 6180 6195) no Hoare annotation was computed. [2019-01-13 12:47:37,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,234 INFO L444 ceAbstractionStarter]: At program point L6313(lines 6302 6315) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-13 12:47:37,234 INFO L448 ceAbstractionStarter]: For program point L6115(line 6115) no Hoare annotation was computed. [2019-01-13 12:47:37,234 INFO L444 ceAbstractionStarter]: At program point L6148(lines 6960 6963) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,234 INFO L448 ceAbstractionStarter]: For program point L6941(lines 6941 6947) no Hoare annotation was computed. [2019-01-13 12:47:37,234 INFO L444 ceAbstractionStarter]: At program point L5752-1(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,234 INFO L444 ceAbstractionStarter]: At program point L5752-2(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,234 INFO L444 ceAbstractionStarter]: At program point L5752(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,235 INFO L444 ceAbstractionStarter]: At program point L5752-5(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,235 INFO L444 ceAbstractionStarter]: At program point L5752-6(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-13 12:47:37,235 INFO L444 ceAbstractionStarter]: At program point L5752-3(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,235 INFO L444 ceAbstractionStarter]: At program point L5752-4(lines 5744 5754) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,235 INFO L448 ceAbstractionStarter]: For program point L6215(line 6215) no Hoare annotation was computed. [2019-01-13 12:47:37,235 INFO L448 ceAbstractionStarter]: For program point L6182(lines 6182 6192) no Hoare annotation was computed. [2019-01-13 12:47:37,236 INFO L444 ceAbstractionStarter]: At program point L7008(lines 7007 7009) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-01-13 12:47:37,237 INFO L448 ceAbstractionStarter]: For program point L6183(line 6183) no Hoare annotation was computed. [2019-01-13 12:47:37,238 INFO L448 ceAbstractionStarter]: For program point L6184(lines 6184 6188) no Hoare annotation was computed. [2019-01-13 12:47:37,238 INFO L448 ceAbstractionStarter]: For program point L6052(line 6052) no Hoare annotation was computed. [2019-01-13 12:47:37,238 INFO L444 ceAbstractionStarter]: At program point L6218(lines 5997 6223) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,238 INFO L444 ceAbstractionStarter]: At program point L7011-1(lines 7010 7012) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,238 INFO L444 ceAbstractionStarter]: At program point L7011(lines 7010 7012) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,238 INFO L448 ceAbstractionStarter]: For program point L6912-1(lines 6912 6915) no Hoare annotation was computed. [2019-01-13 12:47:37,238 INFO L448 ceAbstractionStarter]: For program point L6912(lines 6912 6915) no Hoare annotation was computed. [2019-01-13 12:47:37,239 INFO L444 ceAbstractionStarter]: At program point L6946(lines 6935 6949) the Hoare annotation is: (let ((.cse0 (= ~ldv_mutex_mutex_of_device~0 1)) (.cse1 (= ~ldv_mutex_lock~0 1)) (.cse2 (= ~ldv_mutex_i_mutex_of_inode~0 1))) (or (and (= ~ldv_mutex_udev~0 2) .cse0 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) .cse1 .cse2) (and .cse0 (= ~ldv_mutex_udev~0 1) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) .cse1 .cse2 (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-3(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-4(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-1(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-2(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-7(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-8(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,239 INFO L451 ceAbstractionStarter]: At program point L5790-5(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,240 INFO L451 ceAbstractionStarter]: At program point L5790-6(lines 5789 5792) the Hoare annotation is: true [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6154(line 6154) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6022(lines 6022 6217) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6088(line 6088) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L444 ceAbstractionStarter]: At program point L6980(lines 6979 6981) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6122(line 6122) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6023(line 6023) no Hoare annotation was computed. [2019-01-13 12:47:37,240 INFO L448 ceAbstractionStarter]: For program point L6089(lines 6089 6093) no Hoare annotation was computed. [2019-01-13 12:47:37,241 INFO L451 ceAbstractionStarter]: At program point L6222(lines 5974 6224) the Hoare annotation is: true [2019-01-13 12:47:37,241 INFO L444 ceAbstractionStarter]: At program point L6321(lines 1 7032) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,241 INFO L448 ceAbstractionStarter]: For program point L6123(lines 6123 6159) no Hoare annotation was computed. [2019-01-13 12:47:37,241 INFO L444 ceAbstractionStarter]: At program point L7015(lines 7014 7016) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,241 INFO L448 ceAbstractionStarter]: For program point L6024(lines 6024 6039) no Hoare annotation was computed. [2019-01-13 12:47:37,241 INFO L444 ceAbstractionStarter]: At program point L5760(lines 5755 5762) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,241 INFO L448 ceAbstractionStarter]: For program point L6190(line 6190) no Hoare annotation was computed. [2019-01-13 12:47:37,241 INFO L444 ceAbstractionStarter]: At program point L6983(lines 6982 6984) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point L6851-1(lines 6851 6854) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point L6851(lines 6851 6854) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L444 ceAbstractionStarter]: At program point L6917(lines 1 7032) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point L6059(line 6059) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point L6026(lines 6026 6036) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L448 ceAbstractionStarter]: For program point L6125(lines 6125 6156) no Hoare annotation was computed. [2019-01-13 12:47:37,242 INFO L444 ceAbstractionStarter]: At program point L6291(lines 6286 6293) the Hoare annotation is: (let ((.cse0 (= ~ldv_mutex_mutex_of_device~0 1)) (.cse1 (= ~ldv_mutex_lock~0 1)) (.cse2 (= ~ldv_mutex_i_mutex_of_inode~0 1))) (or (and (= ~ldv_mutex_udev~0 2) .cse0 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|) .cse1 .cse2 (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|)) (and (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) .cse0 (= ~ldv_mutex_udev~0 1) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) .cse1 .cse2 (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6126(line 6126) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6027(line 6027) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6060(lines 6060 6120) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6127(lines 6127 6132) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L444 ceAbstractionStarter]: At program point L7019(lines 7018 7020) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6028(lines 6028 6032) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6095(line 6095) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6062(lines 6062 6117) no Hoare annotation was computed. [2019-01-13 12:47:37,243 INFO L448 ceAbstractionStarter]: For program point L6161(line 6161) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L444 ceAbstractionStarter]: At program point L6987(lines 6986 6988) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327-1(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327-5(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6162(lines 6162 6177) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327-4(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327-3(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6327-2(line 6327) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6063(line 6063) no Hoare annotation was computed. [2019-01-13 12:47:37,244 INFO L448 ceAbstractionStarter]: For program point L6096(lines 6096 6103) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L444 ceAbstractionStarter]: At program point L6856(lines 6848 6858) the Hoare annotation is: (and (= ~ldv_mutex_udev~0 2) (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,245 INFO L448 ceAbstractionStarter]: For program point L6064(lines 6064 6072) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L448 ceAbstractionStarter]: For program point L6098(lines 6098 6101) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L448 ceAbstractionStarter]: For program point L6197(line 6197) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L448 ceAbstractionStarter]: For program point L6164(lines 6164 6174) no Hoare annotation was computed. [2019-01-13 12:47:37,245 INFO L444 ceAbstractionStarter]: At program point L7023(lines 7022 7024) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,245 INFO L444 ceAbstractionStarter]: At program point L5768-1(lines 5763 5770) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,245 INFO L444 ceAbstractionStarter]: At program point L5768(lines 5763 5770) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,246 INFO L448 ceAbstractionStarter]: For program point L6198(lines 6198 6213) no Hoare annotation was computed. [2019-01-13 12:47:37,246 INFO L448 ceAbstractionStarter]: For program point L6066(lines 6066 6070) no Hoare annotation was computed. [2019-01-13 12:47:37,246 INFO L448 ceAbstractionStarter]: For program point L6165(line 6165) no Hoare annotation was computed. [2019-01-13 12:47:37,246 INFO L444 ceAbstractionStarter]: At program point L5835(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,246 INFO L444 ceAbstractionStarter]: At program point L5835-1(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,246 INFO L444 ceAbstractionStarter]: At program point L5835-2(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,246 INFO L444 ceAbstractionStarter]: At program point L5835-3(lines 5832 5837) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,246 INFO L448 ceAbstractionStarter]: For program point L6166(lines 6166 6170) no Hoare annotation was computed. [2019-01-13 12:47:37,246 INFO L448 ceAbstractionStarter]: For program point L6034(line 6034) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6134(line 6134) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6200(lines 6200 6210) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6960(lines 6959 6977) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6135(lines 6135 6152) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6201(line 6201) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6202(lines 6202 6206) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6328) no Hoare annotation was computed. [2019-01-13 12:47:37,247 INFO L444 ceAbstractionStarter]: At program point L5971(lines 5965 5973) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-13 12:47:37,247 INFO L448 ceAbstractionStarter]: For program point L6137-2(lines 6135 6151) no Hoare annotation was computed. [2019-01-13 12:47:37,248 INFO L448 ceAbstractionStarter]: For program point L6137(lines 6137 6145) no Hoare annotation was computed. [2019-01-13 12:47:37,250 INFO L448 ceAbstractionStarter]: For program point L6105(line 6105) no Hoare annotation was computed. [2019-01-13 12:47:37,250 INFO L448 ceAbstractionStarter]: For program point L6964(lines 6959 6977) no Hoare annotation was computed. [2019-01-13 12:47:37,250 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,250 INFO L448 ceAbstractionStarter]: For program point L6106(lines 6106 6113) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6172(line 6172) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6338(lines 6338 6341) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6338-1(lines 6338 6341) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6074(line 6074) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6041(line 6041) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6075(lines 6075 6080) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6042(lines 6042 6057) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L448 ceAbstractionStarter]: For program point L6075-2(lines 6062 6117) no Hoare annotation was computed. [2019-01-13 12:47:37,251 INFO L444 ceAbstractionStarter]: At program point L7000(lines 6999 7001) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L6208(line 6208) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L6968(lines 6959 6977) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L6044(lines 6044 6054) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,252 INFO L444 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1)) [2019-01-13 12:47:37,252 INFO L448 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,253 INFO L448 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-01-13 12:47:37,253 INFO L444 ceAbstractionStarter]: At program point L6342(lines 6331 6344) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-01-13 12:47:37,253 INFO L448 ceAbstractionStarter]: For program point L6045(line 6045) no Hoare annotation was computed. [2019-01-13 12:47:37,253 INFO L448 ceAbstractionStarter]: For program point L5847(lines 5847 5850) no Hoare annotation was computed. [2019-01-13 12:47:37,253 INFO L448 ceAbstractionStarter]: For program point L6046(lines 6046 6050) no Hoare annotation was computed. [2019-01-13 12:47:37,253 INFO L444 ceAbstractionStarter]: At program point L7004(lines 7003 7005) the Hoare annotation is: (and (= ~ldv_mutex_mutex_of_device~0 1) (= ~ldv_mutex_udev~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= 1 ~ldv_state_variable_0~0)) [2019-01-13 12:47:37,253 INFO L448 ceAbstractionStarter]: For program point L6179(line 6179) no Hoare annotation was computed. [2019-01-13 12:47:37,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 12:47:37 BoogieIcfgContainer [2019-01-13 12:47:37,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 12:47:37,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 12:47:37,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 12:47:37,301 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 12:47:37,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 12:47:28" (3/4) ... [2019-01-13 12:47:37,306 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 12:47:37,340 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2019-01-13 12:47:37,343 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-13 12:47:37,345 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 12:47:37,403 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) || ((((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) [2019-01-13 12:47:37,403 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result) || (((((((\result + 1 <= 0 && ldv_mutex_mutex_of_device == 1) && ldv_mutex_udev == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) [2019-01-13 12:47:37,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0 [2019-01-13 12:47:37,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result [2019-01-13 12:47:37,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result [2019-01-13 12:47:37,720 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 12:47:37,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 12:47:37,721 INFO L168 Benchmark]: Toolchain (without parser) took 13781.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -86.5 MB). Peak memory consumption was 255.3 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,722 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 12:47:37,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1971.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 96.1 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 173.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,724 INFO L168 Benchmark]: Boogie Preprocessor took 194.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,724 INFO L168 Benchmark]: RCFGBuilder took 2350.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.7 MB in the end (delta: 175.2 MB). Peak memory consumption was 175.2 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,724 INFO L168 Benchmark]: TraceAbstraction took 8668.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 145.8 MB). Free memory was 914.7 MB in the beginning and 1.2 GB in the end (delta: -287.3 MB). Peak memory consumption was 211.1 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,726 INFO L168 Benchmark]: Witness Printer took 419.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 174.9 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. [2019-01-13 12:47:37,729 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1971.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 96.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 173.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 194.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2350.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.7 MB in the end (delta: 175.2 MB). Peak memory consumption was 175.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8668.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 145.8 MB). Free memory was 914.7 MB in the beginning and 1.2 GB in the end (delta: -287.3 MB). Peak memory consumption was 211.1 MB. Max. memory is 11.5 GB. * Witness Printer took 419.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 174.9 MB). Peak memory consumption was 174.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: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7018]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7007]: Loop Invariant Derived loop invariant: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result - InvariantResult [Line: 5997]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6935]: Loop Invariant Derived loop invariant: ((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) || ((((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) - InvariantResult [Line: 5943]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7022]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6982]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6986]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6960]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6979]: Loop Invariant Derived loop invariant: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && r == 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5755]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5832]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7010]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7003]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6331]: Loop Invariant Derived loop invariant: ((((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0 - InvariantResult [Line: 5763]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5744]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6302]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 6286]: Loop Invariant Derived loop invariant: (((((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && 0 == \result) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 0 == \result) || (((((((\result + 1 <= 0 && ldv_mutex_mutex_of_device == 1) && ldv_mutex_udev == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && ret + 1 <= 0) - InvariantResult [Line: 5965]: Loop Invariant Derived loop invariant: (((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1) && 1 == ldv_state_variable_0 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6848]: Loop Invariant Derived loop invariant: ((ldv_mutex_udev == 2 && ldv_mutex_mutex_of_device == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 7014]: Loop Invariant Derived loop invariant: ((ldv_mutex_mutex_of_device == 1 && ldv_mutex_udev == 1) && ldv_mutex_lock == 1) && ldv_mutex_i_mutex_of_inode == 1 - InvariantResult [Line: 5789]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 6 error locations. SAFE Result, 8.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2093 SDtfs, 2504 SDslu, 2768 SDs, 0 SdLazy, 88 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 203 NumberOfFragments, 634 HoareAnnotationTreeSize, 48 FomulaSimplifications, 10309 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...