./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:51:09,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:51:09,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:51:09,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:51:09,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:51:09,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:51:09,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:51:09,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:51:09,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:51:09,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:51:09,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:51:09,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:51:09,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:51:09,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:51:09,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:51:09,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:51:09,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:51:09,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:51:09,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:51:09,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:51:09,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:51:09,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:51:09,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:51:09,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:51:09,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:51:09,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:51:09,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:51:09,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:51:09,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:51:09,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:51:09,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:51:09,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:51:09,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:51:09,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:51:09,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:51:09,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:51:09,972 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 09:51:09,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:51:09,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:51:09,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:51:09,983 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 09:51:09,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:51:09,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:51:09,983 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:51:09,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:51:09,984 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:51:09,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:51:09,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:51:09,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:51:09,985 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:51:09,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:51:09,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:51:09,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:51:09,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:51:09,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:51:09,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:51:09,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:51:09,987 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e [2018-11-18 09:51:10,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:51:10,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:51:10,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:51:10,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:51:10,024 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:51:10,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 09:51:10,069 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/data/52bf8c909/afbbc81c4cd842c1ad73a2f05d37595d/FLAG4dc506e5a [2018-11-18 09:51:10,406 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:51:10,407 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 09:51:10,414 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/data/52bf8c909/afbbc81c4cd842c1ad73a2f05d37595d/FLAG4dc506e5a [2018-11-18 09:51:10,825 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/data/52bf8c909/afbbc81c4cd842c1ad73a2f05d37595d [2018-11-18 09:51:10,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:51:10,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:51:10,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:51:10,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:51:10,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:51:10,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:10" (1/1) ... [2018-11-18 09:51:10,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fecd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:10, skipping insertion in model container [2018-11-18 09:51:10,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:10" (1/1) ... [2018-11-18 09:51:10,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:51:10,868 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:51:10,999 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:51:11,002 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:51:11,032 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:51:11,043 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:51:11,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11 WrapperNode [2018-11-18 09:51:11,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:51:11,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:51:11,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:51:11,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:51:11,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... [2018-11-18 09:51:11,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:51:11,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:51:11,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:51:11,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:51:11,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 09:51:11,158 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 09:51:11,159 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2018-11-18 09:51:11,159 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 09:51:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:51:11,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:51:11,288 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:51:11,289 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:51:11,381 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:51:11,381 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:51:11,451 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:51:11,451 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:51:11,500 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:51:11,500 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:51:11,588 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:51:11,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:11 BoogieIcfgContainer [2018-11-18 09:51:11,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:51:11,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:51:11,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:51:11,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:51:11,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:51:10" (1/3) ... [2018-11-18 09:51:11,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f90525c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:11, skipping insertion in model container [2018-11-18 09:51:11,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:11" (2/3) ... [2018-11-18 09:51:11,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f90525c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:11, skipping insertion in model container [2018-11-18 09:51:11,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:11" (3/3) ... [2018-11-18 09:51:11,596 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 09:51:11,602 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:51:11,607 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:51:11,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:51:11,636 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:51:11,637 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:51:11,637 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:51:11,637 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:51:11,637 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:51:11,637 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:51:11,638 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:51:11,638 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:51:11,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:51:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-11-18 09:51:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:51:11,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:11,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:11,662 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:11,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2018-11-18 09:51:11,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:11,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:11,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:11,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:11,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:11,835 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2018-11-18 09:51:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:11,896 INFO L93 Difference]: Finished difference Result 286 states and 438 transitions. [2018-11-18 09:51:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:11,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 09:51:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:11,905 INFO L225 Difference]: With dead ends: 286 [2018-11-18 09:51:11,905 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 09:51:11,907 INFO L604 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 [2018-11-18 09:51:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 09:51:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-18 09:51:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 09:51:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2018-11-18 09:51:11,940 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2018-11-18 09:51:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:11,940 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2018-11-18 09:51:11,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2018-11-18 09:51:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 09:51:11,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:11,941 INFO L375 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] [2018-11-18 09:51:11,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:11,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2018-11-18 09:51:11,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:12,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:12,057 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2018-11-18 09:51:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,163 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2018-11-18 09:51:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:12,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 09:51:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,166 INFO L225 Difference]: With dead ends: 258 [2018-11-18 09:51:12,166 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 09:51:12,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 09:51:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2018-11-18 09:51:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 09:51:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2018-11-18 09:51:12,183 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2018-11-18 09:51:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,183 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2018-11-18 09:51:12,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2018-11-18 09:51:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 09:51:12,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,184 INFO L375 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] [2018-11-18 09:51:12,184 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2018-11-18 09:51:12,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:51:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:51:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:51:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:51:12,273 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2018-11-18 09:51:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,325 INFO L93 Difference]: Finished difference Result 310 states and 406 transitions. [2018-11-18 09:51:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:51:12,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 09:51:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,327 INFO L225 Difference]: With dead ends: 310 [2018-11-18 09:51:12,327 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 09:51:12,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:51:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 09:51:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2018-11-18 09:51:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-18 09:51:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2018-11-18 09:51:12,348 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2018-11-18 09:51:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2018-11-18 09:51:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:51:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2018-11-18 09:51:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 09:51:12,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,350 INFO L375 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] [2018-11-18 09:51:12,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2018-11-18 09:51:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:51:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:51:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:51:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:51:12,433 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2018-11-18 09:51:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,525 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-11-18 09:51:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:51:12,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-18 09:51:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,526 INFO L225 Difference]: With dead ends: 214 [2018-11-18 09:51:12,527 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 09:51:12,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:51:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 09:51:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-11-18 09:51:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-18 09:51:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2018-11-18 09:51:12,542 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2018-11-18 09:51:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,542 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2018-11-18 09:51:12,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:51:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2018-11-18 09:51:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 09:51:12,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:12,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2018-11-18 09:51:12,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:51:12,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:51:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:51:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:51:12,591 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2018-11-18 09:51:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,649 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2018-11-18 09:51:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:51:12,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-18 09:51:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,652 INFO L225 Difference]: With dead ends: 268 [2018-11-18 09:51:12,652 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 09:51:12,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:51:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 09:51:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2018-11-18 09:51:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 09:51:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2018-11-18 09:51:12,664 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2018-11-18 09:51:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,664 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2018-11-18 09:51:12,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:51:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2018-11-18 09:51:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 09:51:12,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:12,666 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,666 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2018-11-18 09:51:12,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:12,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:12,723 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2018-11-18 09:51:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,762 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2018-11-18 09:51:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:12,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-18 09:51:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,764 INFO L225 Difference]: With dead ends: 243 [2018-11-18 09:51:12,764 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 09:51:12,764 INFO L604 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 [2018-11-18 09:51:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 09:51:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-18 09:51:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 09:51:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2018-11-18 09:51:12,773 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2018-11-18 09:51:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,773 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2018-11-18 09:51:12,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2018-11-18 09:51:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 09:51:12,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,776 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:12,776 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2018-11-18 09:51:12,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:12,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:12,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:12,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:12,819 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2018-11-18 09:51:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,839 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-18 09:51:12,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:12,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 09:51:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,841 INFO L225 Difference]: With dead ends: 191 [2018-11-18 09:51:12,841 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 09:51:12,841 INFO L604 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 [2018-11-18 09:51:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 09:51:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-18 09:51:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 09:51:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-11-18 09:51:12,846 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2018-11-18 09:51:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,847 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-11-18 09:51:12,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-11-18 09:51:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 09:51:12,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:12,848 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2018-11-18 09:51:12,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:12,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:51:12,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:51:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:51:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:51:12,910 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2018-11-18 09:51:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:12,941 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2018-11-18 09:51:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:51:12,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-18 09:51:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:12,942 INFO L225 Difference]: With dead ends: 142 [2018-11-18 09:51:12,942 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 09:51:12,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 09:51:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-11-18 09:51:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 09:51:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-11-18 09:51:12,949 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2018-11-18 09:51:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-18 09:51:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:51:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-11-18 09:51:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 09:51:12,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:12,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:12,952 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2018-11-18 09:51:12,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:12,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:51:13,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:51:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:51:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:51:13,010 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2018-11-18 09:51:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,041 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-11-18 09:51:13,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:51:13,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-18 09:51:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,043 INFO L225 Difference]: With dead ends: 107 [2018-11-18 09:51:13,043 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 09:51:13,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:51:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 09:51:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-18 09:51:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 09:51:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-18 09:51:13,049 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2018-11-18 09:51:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,050 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-18 09:51:13,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:51:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-18 09:51:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 09:51:13,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,050 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2018-11-18 09:51:13,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:13,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:13,095 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2018-11-18 09:51:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,117 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-11-18 09:51:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:13,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-18 09:51:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,118 INFO L225 Difference]: With dead ends: 187 [2018-11-18 09:51:13,119 INFO L226 Difference]: Without dead ends: 180 [2018-11-18 09:51:13,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-18 09:51:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2018-11-18 09:51:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-18 09:51:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-11-18 09:51:13,128 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2018-11-18 09:51:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,128 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-11-18 09:51:13,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-11-18 09:51:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 09:51:13,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,129 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2018-11-18 09:51:13,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:51:13,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:51:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:51:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:51:13,192 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-11-18 09:51:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,260 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2018-11-18 09:51:13,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:51:13,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-18 09:51:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,261 INFO L225 Difference]: With dead ends: 216 [2018-11-18 09:51:13,261 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 09:51:13,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 09:51:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-18 09:51:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 09:51:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-11-18 09:51:13,269 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2018-11-18 09:51:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,269 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-11-18 09:51:13,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:51:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-11-18 09:51:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 09:51:13,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2018-11-18 09:51:13,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:13,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:13,301 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2018-11-18 09:51:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,313 INFO L93 Difference]: Finished difference Result 212 states and 240 transitions. [2018-11-18 09:51:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:13,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 09:51:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,315 INFO L225 Difference]: With dead ends: 212 [2018-11-18 09:51:13,315 INFO L226 Difference]: Without dead ends: 164 [2018-11-18 09:51:13,315 INFO L604 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 [2018-11-18 09:51:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-18 09:51:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-11-18 09:51:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 09:51:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2018-11-18 09:51:13,325 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2018-11-18 09:51:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,325 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2018-11-18 09:51:13,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2018-11-18 09:51:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 09:51:13,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,326 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,326 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2018-11-18 09:51:13,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:51:13,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:51:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:51:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:51:13,370 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2018-11-18 09:51:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,406 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2018-11-18 09:51:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:51:13,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 09:51:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,407 INFO L225 Difference]: With dead ends: 178 [2018-11-18 09:51:13,407 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 09:51:13,408 INFO L604 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 [2018-11-18 09:51:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 09:51:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2018-11-18 09:51:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 09:51:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2018-11-18 09:51:13,416 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2018-11-18 09:51:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,416 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2018-11-18 09:51:13,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:51:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2018-11-18 09:51:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 09:51:13,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,418 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2018-11-18 09:51:13,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:51:13,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:51:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:51:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:13,464 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2018-11-18 09:51:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,494 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-11-18 09:51:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:51:13,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-18 09:51:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,495 INFO L225 Difference]: With dead ends: 184 [2018-11-18 09:51:13,495 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 09:51:13,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:51:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 09:51:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-18 09:51:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 09:51:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-11-18 09:51:13,504 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2018-11-18 09:51:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,504 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-11-18 09:51:13,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:51:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-11-18 09:51:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:51:13,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,505 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2018-11-18 09:51:13,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:51:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:51:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:51:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:13,558 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 7 states. [2018-11-18 09:51:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,648 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-11-18 09:51:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:51:13,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-11-18 09:51:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,649 INFO L225 Difference]: With dead ends: 176 [2018-11-18 09:51:13,649 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 09:51:13,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:51:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 09:51:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2018-11-18 09:51:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 09:51:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-11-18 09:51:13,657 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2018-11-18 09:51:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,658 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-11-18 09:51:13,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:51:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-11-18 09:51:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:51:13,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,658 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,659 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2018-11-18 09:51:13,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:51:13,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:51:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:51:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:51:13,731 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2018-11-18 09:51:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,790 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2018-11-18 09:51:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:51:13,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 09:51:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,791 INFO L225 Difference]: With dead ends: 165 [2018-11-18 09:51:13,791 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 09:51:13,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:51:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 09:51:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-18 09:51:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 09:51:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-11-18 09:51:13,799 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2018-11-18 09:51:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,799 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-11-18 09:51:13,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:51:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-18 09:51:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:51:13,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,800 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2018-11-18 09:51:13,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:51:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:51:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:51:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:51:13,865 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2018-11-18 09:51:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,884 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-11-18 09:51:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:51:13,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-18 09:51:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:13,885 INFO L225 Difference]: With dead ends: 144 [2018-11-18 09:51:13,885 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 09:51:13,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 09:51:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-18 09:51:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 09:51:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-11-18 09:51:13,892 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2018-11-18 09:51:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:13,892 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-11-18 09:51:13,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:51:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-11-18 09:51:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 09:51:13,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:51:13,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,893 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:51:13,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2018-11-18 09:51:13,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:13,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:51:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:51:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:51:13,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:51:13,950 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2018-11-18 09:51:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:14,002 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-11-18 09:51:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:51:14,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-18 09:51:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:51:14,003 INFO L225 Difference]: With dead ends: 133 [2018-11-18 09:51:14,003 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:51:14,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:51:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:51:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:51:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:51:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:51:14,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2018-11-18 09:51:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:51:14,004 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:51:14,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:51:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:51:14,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:51:14,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:51:14,599 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-11-18 09:51:15,117 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-18 09:51:16,465 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2018-11-18 09:51:16,465 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2018-11-18 09:51:16,465 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2018-11-18 09:51:16,465 INFO L428 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2018-11-18 09:51:16,465 INFO L428 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2018-11-18 09:51:16,465 INFO L425 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-18 09:51:16,465 INFO L425 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2018-11-18 09:51:16,465 INFO L425 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1) (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0))) [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2018-11-18 09:51:16,466 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L421 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L421 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L421 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 355 365) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point $Ultimate##13(lines 355 365) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L425 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2018-11-18 09:51:16,467 INFO L421 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= ~compRegistered~0 0)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L421 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L421 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L421 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2018-11-18 09:51:16,468 INFO L421 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,468 INFO L425 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L421 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= ~compRegistered~0 0)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 444 447) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point $Ultimate##8(lines 459 471) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 459 471) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L421 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (= ~NP~0 ~s~0) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-11-18 09:51:16,469 INFO L425 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2018-11-18 09:51:16,469 INFO L421 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (let ((.cse3 (= ~MPR1~0 ~s~0))) (or (< ~MPR3~0 (+ ~NP~0 5)) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (and .cse3 (= 0 IofCallDriver_~returnVal2~0)) (< 1 ~NP~0) .cse2 (and .cse3 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (= |old(~s~0)| ~NP~0)) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (and .cse3 (= IofCallDriver_~returnVal2~0 259) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))))) [2018-11-18 09:51:16,469 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (= ~NP~0 ~s~0) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (and (= ~MPR1~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (and (= ~NP~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (= ~MPR1~0 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (= ~MPR1~0 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-11-18 09:51:16,470 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (not (= |old(~s~0)| ~NP~0)) (< ~setEventCalled~0 1) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-18 09:51:16,470 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (= ~NP~0 ~s~0) (< 1 ~NP~0) (< ~SKIP1~0 3) (not (= |old(~s~0)| ~NP~0)) (< ~setEventCalled~0 1) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L421 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 (< 1 |old(~setEventCalled~0)|)))) [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 553 560) no Hoare annotation was computed. [2018-11-18 09:51:16,471 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 553 560) no Hoare annotation was computed. [2018-11-18 09:51:16,472 INFO L421 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3)) (.cse6 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (not (= ~pended~0 1))))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 .cse6 (< 1 |old(~setEventCalled~0)|)))) [2018-11-18 09:51:16,472 INFO L421 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3)) (.cse6 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (not (= ~pended~0 1))))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 .cse6 (< 1 |old(~setEventCalled~0)|)))) [2018-11-18 09:51:16,472 INFO L421 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse4 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP1~0 3)) (.cse3 (< ~MPR1~0 (+ ~NP~0 4)))) (and (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (< 1 ~NP~0) .cse5 (< 1 |old(~setEventCalled~0)|)) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse5) .cse3))) [2018-11-18 09:51:16,472 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2018-11-18 09:51:16,472 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2018-11-18 09:51:16,472 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 527 546) no Hoare annotation was computed. [2018-11-18 09:51:16,472 INFO L425 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2018-11-18 09:51:16,472 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse4 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP1~0 3)) (.cse3 (< ~MPR1~0 (+ ~NP~0 4)))) (and (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse4 (< 1 ~NP~0) .cse5 (< 1 |old(~setEventCalled~0)|)) (or .cse0 (= ~NP~0 ~s~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse5) .cse3))) [2018-11-18 09:51:16,472 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L421 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP1~0 3)) [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP1~0 3) (= ~s~0 ~NP~0)) [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) [2018-11-18 09:51:16,473 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:51:16,473 INFO L421 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,473 INFO L425 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L421 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L421 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-11-18 09:51:16,474 INFO L421 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse11 (<= 1 ~compRegistered~0)) (.cse12 (+ ~NP~0 5))) (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (and (<= .cse12 ~MPR3~0) (= ~NP~0 ~s~0) .cse11)) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse6 (< 1 ~NP~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (< 0 |old(~compRegistered~0)|)) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10) (or .cse0 .cse1 .cse2 .cse3 (and (<= 259 KbFilter_PnP_~__cil_tmp23~0) .cse11 (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~s~0 ~MPR3~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2018-11-18 09:51:16,474 INFO L421 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (< 0 |old(~compRegistered~0)|) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,475 INFO L421 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,475 INFO L421 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2018-11-18 09:51:16,475 INFO L421 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,475 INFO L421 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~compRegistered~0) (= ~NP~0 ~s~0) (<= 0 KbFilter_PnP_~status~0)) .cse8 .cse9) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) .cse8 .cse9))) [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2018-11-18 09:51:16,475 INFO L425 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L428 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L421 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= ~compRegistered~0 0))))) [2018-11-18 09:51:16,476 INFO L421 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2018-11-18 09:51:16,476 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L421 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-11-18 09:51:16,477 INFO L421 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L421 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2018-11-18 09:51:16,477 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L421 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L421 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point $Ultimate##43(lines 165 262) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2018-11-18 09:51:16,478 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2018-11-18 09:51:16,479 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2018-11-18 09:51:16,479 INFO L425 ceAbstractionStarter]: For program point $Ultimate##44(lines 165 262) no Hoare annotation was computed. [2018-11-18 09:51:16,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:51:16 BoogieIcfgContainer [2018-11-18 09:51:16,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:51:16,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:51:16,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:51:16,506 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:51:16,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:11" (3/4) ... [2018-11-18 09:51:16,517 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:51:16,522 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 09:51:16,522 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 09:51:16,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2018-11-18 09:51:16,530 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2018-11-18 09:51:16,531 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-18 09:51:16,531 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 09:51:16,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) [2018-11-18 09:51:16,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) [2018-11-18 09:51:16,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && 0 <= status) && NP == s) && SKIP1 <= 3) && 3 <= SKIP1) && s <= 1) && !(pended == 1)) && compRegistered <= 0)) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 0 <= status) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && (((((((((((MPR3 < NP + 5 || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == returnVal2)) || 1 < NP) || SKIP1 < 3) || (MPR1 == s && returnVal2 + 1073741823 <= 0)) || !(\old(s) == NP)) || compRegistered < 1) || \old(s) < 1) || (((MPR1 == s && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || s == NP) || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) && ((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || 1 < \old(setEventCalled)) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) [2018-11-18 09:51:16,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((MPR3 < NP + 5 || ((MPR1 == s && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) && ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) [2018-11-18 09:51:16,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 <= compRegistered && NP == s) && 0 <= status) && compRegistered <= 0) || \old(compRegistered) < 0) || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) && (((((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || myStatus + 1073741637 <= 0) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) [2018-11-18 09:51:16,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-11-18 09:51:16,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-11-18 09:51:16,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-11-18 09:51:16,597 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc39bb85-6334-4e83-a1a2-1df58050db1e/bin-2019/uautomizer/witness.graphml [2018-11-18 09:51:16,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:51:16,598 INFO L168 Benchmark]: Toolchain (without parser) took 5769.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 193.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,598 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:51:16,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 939.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,598 INFO L168 Benchmark]: Boogie Preprocessor took 71.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,601 INFO L168 Benchmark]: RCFGBuilder took 475.03 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,601 INFO L168 Benchmark]: TraceAbstraction took 4914.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 443.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,602 INFO L168 Benchmark]: Witness Printer took 91.29 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,603 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 939.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.03 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4914.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 443.3 MB. Max. memory is 11.5 GB. * Witness Printer took 91.29 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 0 <= status) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && (((((((((((MPR3 < NP + 5 || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == returnVal2)) || 1 < NP) || SKIP1 < 3) || (MPR1 == s && returnVal2 + 1073741823 <= 0)) || !(\old(s) == NP)) || compRegistered < 1) || \old(s) < 1) || (((MPR1 == s && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || s == NP) || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) && ((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((MPR3 < NP + 5 || ((MPR1 == s && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) && ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((0 <= compRegistered && NP == s) && 0 <= status) && compRegistered <= 0) || \old(compRegistered) < 0) || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) && (((((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || myStatus + 1073741637 <= 0) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && 0 <= status) && NP == s) && SKIP1 <= 3) && 3 <= SKIP1) && s <= 1) && !(pended == 1)) && compRegistered <= 0)) || \old(MPR3) < 0) || 0 < \old(compRegistered) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 159 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2243 SDtfs, 1294 SDslu, 2856 SDs, 0 SdLazy, 602 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 309 PreInvPairs, 382 NumberOfFragments, 3065 HoareAnnotationTreeSize, 309 FomulaSimplifications, 319 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 4642 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 91783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...