./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99a77f5372e1d3174eb539425b8da52ff3b34c76 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-01 03:29:43,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 03:29:43,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 03:29:43,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 03:29:43,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 03:29:43,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 03:29:43,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 03:29:43,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 03:29:43,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 03:29:43,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 03:29:43,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 03:29:43,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 03:29:43,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 03:29:43,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 03:29:43,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 03:29:43,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 03:29:43,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 03:29:43,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 03:29:43,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 03:29:43,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 03:29:43,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 03:29:43,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 03:29:43,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 03:29:43,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 03:29:43,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 03:29:43,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 03:29:43,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 03:29:43,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 03:29:43,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 03:29:43,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 03:29:43,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 03:29:43,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 03:29:43,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 03:29:43,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 03:29:43,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 03:29:43,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 03:29:43,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 03:29:43,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 03:29:43,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 03:29:43,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 03:29:43,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 03:29:43,158 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 03:29:43,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 03:29:43,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 03:29:43,167 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 03:29:43,167 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 03:29:43,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 03:29:43,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 03:29:43,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 03:29:43,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 03:29:43,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 03:29:43,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 03:29:43,170 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 03:29:43,170 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 03:29:43,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 03:29:43,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 03:29:43,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 03:29:43,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 03:29:43,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 03:29:43,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 03:29:43,171 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 03:29:43,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 03:29:43,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 03:29:43,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak 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 -> Kojak 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 -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-12-01 03:29:43,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 03:29:43,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 03:29:43,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 03:29:43,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 03:29:43,282 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 03:29:43,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-12-01 03:29:43,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/data/ab2df4e9a/42d14184930445218785c510925309a4/FLAG86e0e7c9a [2019-12-01 03:29:43,660 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 03:29:43,661 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-12-01 03:29:43,670 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/data/ab2df4e9a/42d14184930445218785c510925309a4/FLAG86e0e7c9a [2019-12-01 03:29:43,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/data/ab2df4e9a/42d14184930445218785c510925309a4 [2019-12-01 03:29:43,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 03:29:43,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 03:29:43,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 03:29:43,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 03:29:43,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 03:29:43,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:43,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c13a2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43, skipping insertion in model container [2019-12-01 03:29:43,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:43,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 03:29:43,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 03:29:43,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 03:29:43,908 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 03:29:43,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 03:29:43,963 INFO L208 MainTranslator]: Completed translation [2019-12-01 03:29:43,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43 WrapperNode [2019-12-01 03:29:43,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 03:29:43,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 03:29:43,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 03:29:43,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 03:29:43,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:43,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 03:29:44,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 03:29:44,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 03:29:44,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 03:29:44,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... [2019-12-01 03:29:44,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 03:29:44,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 03:29:44,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 03:29:44,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 03:29:44,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:29:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-01 03:29:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-12-01 03:29:44,072 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-12-01 03:29:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 03:29:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-12-01 03:29:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-12-01 03:29:44,238 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,242 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,244 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,247 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,249 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2019-12-01 03:29:44,477 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-12-01 03:29:44,478 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-12-01 03:29:44,478 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2019-12-01 03:29:44,478 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2019-12-01 03:29:44,486 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-01 03:29:44,504 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-12-01 03:29:44,504 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-12-01 03:29:44,782 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 03:29:44,783 INFO L287 CfgBuilder]: Removed 20 assume(true) statements. [2019-12-01 03:29:44,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:29:44 BoogieIcfgContainer [2019-12-01 03:29:44,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 03:29:44,784 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 03:29:44,784 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 03:29:44,794 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 03:29:44,794 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:29:44" (1/1) ... [2019-12-01 03:29:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 03:29:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 139 states and 221 transitions. [2019-12-01 03:29:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 221 transitions. [2019-12-01 03:29:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-01 03:29:44,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 137 states and 204 transitions. [2019-12-01 03:29:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2019-12-01 03:29:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-01 03:29:44,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 136 states and 202 transitions. [2019-12-01 03:29:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2019-12-01 03:29:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 03:29:45,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 136 states and 201 transitions. [2019-12-01 03:29:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2019-12-01 03:29:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 03:29:45,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 135 states and 199 transitions. [2019-12-01 03:29:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2019-12-01 03:29:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 03:29:45,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 134 states and 197 transitions. [2019-12-01 03:29:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2019-12-01 03:29:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 03:29:45,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 141 states and 207 transitions. [2019-12-01 03:29:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2019-12-01 03:29:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 03:29:45,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 142 states and 208 transitions. [2019-12-01 03:29:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2019-12-01 03:29:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 03:29:45,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 141 states and 206 transitions. [2019-12-01 03:29:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 206 transitions. [2019-12-01 03:29:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 03:29:45,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 140 states and 204 transitions. [2019-12-01 03:29:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 204 transitions. [2019-12-01 03:29:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 03:29:45,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 141 states and 204 transitions. [2019-12-01 03:29:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2019-12-01 03:29:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 03:29:45,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 134 states and 194 transitions. [2019-12-01 03:29:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2019-12-01 03:29:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 03:29:45,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 138 states and 207 transitions. [2019-12-01 03:29:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 207 transitions. [2019-12-01 03:29:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 03:29:45,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 139 states and 207 transitions. [2019-12-01 03:29:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 207 transitions. [2019-12-01 03:29:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 03:29:45,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 139 states and 206 transitions. [2019-12-01 03:29:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2019-12-01 03:29:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-01 03:29:45,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 139 states and 205 transitions. [2019-12-01 03:29:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2019-12-01 03:29:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 03:29:45,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 143 states and 212 transitions. [2019-12-01 03:29:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-12-01 03:29:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-01 03:29:45,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 144 states and 218 transitions. [2019-12-01 03:29:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2019-12-01 03:29:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-01 03:29:45,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 144 states and 217 transitions. [2019-12-01 03:29:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 217 transitions. [2019-12-01 03:29:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 03:29:45,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 135 states and 200 transitions. [2019-12-01 03:29:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-12-01 03:29:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 03:29:45,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 141 states and 214 transitions. [2019-12-01 03:29:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-12-01 03:29:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 03:29:45,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 143 states and 219 transitions. [2019-12-01 03:29:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-12-01 03:29:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 03:29:45,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 143 states and 218 transitions. [2019-12-01 03:29:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-12-01 03:29:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 03:29:45,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 143 states and 217 transitions. [2019-12-01 03:29:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-12-01 03:29:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:45,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 143 states and 215 transitions. [2019-12-01 03:29:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-12-01 03:29:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 03:29:45,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 143 states and 213 transitions. [2019-12-01 03:29:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-12-01 03:29:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 03:29:46,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 141 states and 208 transitions. [2019-12-01 03:29:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-12-01 03:29:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 03:29:46,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 143 states and 212 transitions. [2019-12-01 03:29:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-12-01 03:29:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 03:29:46,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 152 states and 227 transitions. [2019-12-01 03:29:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-12-01 03:29:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 03:29:46,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 153 states and 228 transitions. [2019-12-01 03:29:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-12-01 03:29:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 03:29:46,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 154 states and 228 transitions. [2019-12-01 03:29:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 228 transitions. [2019-12-01 03:29:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:46,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 154 states and 227 transitions. [2019-12-01 03:29:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 227 transitions. [2019-12-01 03:29:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 03:29:46,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 147 states and 216 transitions. [2019-12-01 03:29:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 216 transitions. [2019-12-01 03:29:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 03:29:46,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 147 states and 215 transitions. [2019-12-01 03:29:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2019-12-01 03:29:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:46,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 154 states and 226 transitions. [2019-12-01 03:29:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2019-12-01 03:29:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:46,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 154 states and 225 transitions. [2019-12-01 03:29:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 225 transitions. [2019-12-01 03:29:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 03:29:46,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 154 states and 224 transitions. [2019-12-01 03:29:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2019-12-01 03:29:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 03:29:46,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 154 states and 223 transitions. [2019-12-01 03:29:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 223 transitions. [2019-12-01 03:29:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 03:29:46,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 154 states and 222 transitions. [2019-12-01 03:29:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2019-12-01 03:29:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 03:29:46,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 154 states and 221 transitions. [2019-12-01 03:29:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2019-12-01 03:29:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:46,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 154 states and 219 transitions. [2019-12-01 03:29:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2019-12-01 03:29:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:46,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 156 states and 221 transitions. [2019-12-01 03:29:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2019-12-01 03:29:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 03:29:46,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 156 states and 219 transitions. [2019-12-01 03:29:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2019-12-01 03:29:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 03:29:46,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 161 states and 229 transitions. [2019-12-01 03:29:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2019-12-01 03:29:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 03:29:46,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 163 states and 241 transitions. [2019-12-01 03:29:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-12-01 03:29:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:46,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 156 states and 232 transitions. [2019-12-01 03:29:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 232 transitions. [2019-12-01 03:29:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 03:29:46,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 157 states and 236 transitions. [2019-12-01 03:29:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 236 transitions. [2019-12-01 03:29:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 03:29:47,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 163 states and 252 transitions. [2019-12-01 03:29:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2019-12-01 03:29:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 03:29:47,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 164 states and 253 transitions. [2019-12-01 03:29:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-12-01 03:29:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 03:29:47,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 164 states and 251 transitions. [2019-12-01 03:29:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 251 transitions. [2019-12-01 03:29:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:47,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 166 states and 258 transitions. [2019-12-01 03:29:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 258 transitions. [2019-12-01 03:29:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:48,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 173 states and 275 transitions. [2019-12-01 03:29:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 275 transitions. [2019-12-01 03:29:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:49,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 173 states and 274 transitions. [2019-12-01 03:29:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 274 transitions. [2019-12-01 03:29:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 03:29:49,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 170 states and 267 transitions. [2019-12-01 03:29:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 267 transitions. [2019-12-01 03:29:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 03:29:51,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 173 states and 270 transitions. [2019-12-01 03:29:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 270 transitions. [2019-12-01 03:29:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:29:51,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 173 states and 269 transitions. [2019-12-01 03:29:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-12-01 03:29:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 03:29:51,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 181 states and 290 transitions. [2019-12-01 03:29:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 290 transitions. [2019-12-01 03:29:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:29:53,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 181 states and 289 transitions. [2019-12-01 03:29:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2019-12-01 03:29:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 03:29:53,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 182 states and 294 transitions. [2019-12-01 03:29:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2019-12-01 03:29:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 03:29:54,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 187 states and 307 transitions. [2019-12-01 03:29:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 307 transitions. [2019-12-01 03:29:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:29:55,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 189 states and 310 transitions. [2019-12-01 03:29:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 310 transitions. [2019-12-01 03:29:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:29:55,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 189 states and 308 transitions. [2019-12-01 03:29:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 308 transitions. [2019-12-01 03:29:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 03:29:56,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 197 states and 333 transitions. [2019-12-01 03:29:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 333 transitions. [2019-12-01 03:29:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:29:58,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 197 states and 332 transitions. [2019-12-01 03:29:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-01 03:29:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:29:58,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:29:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:29:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 203 states and 353 transitions. [2019-12-01 03:29:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 353 transitions. [2019-12-01 03:29:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:29:59,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:29:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:29:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 209 states and 369 transitions. [2019-12-01 03:30:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 369 transitions. [2019-12-01 03:30:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:30:01,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 210 states and 370 transitions. [2019-12-01 03:30:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 370 transitions. [2019-12-01 03:30:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:30:01,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 215 states and 392 transitions. [2019-12-01 03:30:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 392 transitions. [2019-12-01 03:30:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:30:03,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 220 states and 404 transitions. [2019-12-01 03:30:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 404 transitions. [2019-12-01 03:30:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 03:30:04,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 220 states and 403 transitions. [2019-12-01 03:30:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 403 transitions. [2019-12-01 03:30:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 03:30:04,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 220 states and 402 transitions. [2019-12-01 03:30:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 402 transitions. [2019-12-01 03:30:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:04,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 221 states and 403 transitions. [2019-12-01 03:30:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 403 transitions. [2019-12-01 03:30:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:04,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 222 states and 404 transitions. [2019-12-01 03:30:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 404 transitions. [2019-12-01 03:30:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:04,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 225 states and 419 transitions. [2019-12-01 03:30:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 419 transitions. [2019-12-01 03:30:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:05,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 226 states and 422 transitions. [2019-12-01 03:30:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 422 transitions. [2019-12-01 03:30:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:06,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 226 states and 421 transitions. [2019-12-01 03:30:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 421 transitions. [2019-12-01 03:30:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 03:30:07,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 226 states and 420 transitions. [2019-12-01 03:30:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 420 transitions. [2019-12-01 03:30:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 03:30:07,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 226 states and 418 transitions. [2019-12-01 03:30:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 418 transitions. [2019-12-01 03:30:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:07,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 226 states and 416 transitions. [2019-12-01 03:30:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 416 transitions. [2019-12-01 03:30:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:07,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 226 states and 415 transitions. [2019-12-01 03:30:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 415 transitions. [2019-12-01 03:30:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:08,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 226 states and 414 transitions. [2019-12-01 03:30:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 414 transitions. [2019-12-01 03:30:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:08,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 226 states and 412 transitions. [2019-12-01 03:30:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 412 transitions. [2019-12-01 03:30:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:08,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 226 states and 411 transitions. [2019-12-01 03:30:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 411 transitions. [2019-12-01 03:30:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:08,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 226 states and 410 transitions. [2019-12-01 03:30:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 410 transitions. [2019-12-01 03:30:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:08,286 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 227 states and 413 transitions. [2019-12-01 03:30:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 413 transitions. [2019-12-01 03:30:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 03:30:11,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 231 states and 424 transitions. [2019-12-01 03:30:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 424 transitions. [2019-12-01 03:30:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 03:30:13,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 233 states and 436 transitions. [2019-12-01 03:30:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 436 transitions. [2019-12-01 03:30:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 03:30:16,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 235 states and 440 transitions. [2019-12-01 03:30:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 440 transitions. [2019-12-01 03:30:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 03:30:16,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 235 states and 438 transitions. [2019-12-01 03:30:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 438 transitions. [2019-12-01 03:30:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 03:30:16,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 236 states and 441 transitions. [2019-12-01 03:30:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 441 transitions. [2019-12-01 03:30:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 03:30:17,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 242 states and 475 transitions. [2019-12-01 03:30:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 475 transitions. [2019-12-01 03:30:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 03:30:22,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 243 states and 479 transitions. [2019-12-01 03:30:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 479 transitions. [2019-12-01 03:30:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 03:30:23,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 243 states and 477 transitions. [2019-12-01 03:30:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 477 transitions. [2019-12-01 03:30:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 03:30:23,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 244 states and 482 transitions. [2019-12-01 03:30:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 482 transitions. [2019-12-01 03:30:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 03:30:24,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 03:30:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 03:30:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 03:30:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 244 states and 481 transitions. [2019-12-01 03:30:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 481 transitions. [2019-12-01 03:30:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 03:30:25,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 03:30:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 03:30:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 03:30:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 03:30:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 03:30:25,255 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 95 iterations. [2019-12-01 03:30:25,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 03:30:25 ImpRootNode [2019-12-01 03:30:25,310 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 03:30:25,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 03:30:25,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 03:30:25,311 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 03:30:25,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:29:44" (3/4) ... [2019-12-01 03:30:25,313 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 03:30:25,411 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_57464ffa-91bc-4887-a94b-e5074fb9c0b4/bin/ukojak/witness.graphml [2019-12-01 03:30:25,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 03:30:25,413 INFO L168 Benchmark]: Toolchain (without parser) took 41730.70 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 499.6 MB). Free memory was 939.3 MB in the beginning and 801.4 MB in the end (delta: 138.0 MB). Peak memory consumption was 637.6 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,413 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 03:30:25,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,414 INFO L168 Benchmark]: Boogie Preprocessor took 28.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,414 INFO L168 Benchmark]: RCFGBuilder took 752.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 928.4 MB in the end (delta: 142.9 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,415 INFO L168 Benchmark]: CodeCheck took 40526.16 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 405.8 MB). Free memory was 928.4 MB in the beginning and 819.3 MB in the end (delta: 109.1 MB). Peak memory consumption was 514.9 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,415 INFO L168 Benchmark]: Witness Printer took 100.67 ms. Allocated memory is still 1.5 GB. Free memory was 819.3 MB in the beginning and 801.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-01 03:30:25,416 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 8 procedures, 139 locations, 1 error locations. Result: UNSAFE, OverallTime: 40.4s, OverallIterations: 95, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -2139087680 SDtfs, 213309168 SDslu, 175442160 SDs, 0 SdLazy, 558660336 SolverSat, 927260840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26355 GetRequests, 25579 SyntacticMatches, 324 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92030 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 145277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 94 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 [L335] COND FALSE !(irp_choice == 0) [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L245] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND FALSE !(tmp_ndt_7 == 1) [L519] returnVal2 = 259 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, __VERIFIER_nondet_int()=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=259, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-1, tmp_ndt_7=2, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, __VERIFIER_nondet_int()=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=259, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-1, tmp_ndt_7=2, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, __VERIFIER_nondet_int()=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=259, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-1, tmp_ndt_7=2, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, __VERIFIER_nondet_int()=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=259, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-1, tmp_ndt_7=2, UNLOADED=0] [L549] return (returnVal2); [L245] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L451] CALL errorFn() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 752.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 928.4 MB in the end (delta: 142.9 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. * CodeCheck took 40526.16 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 405.8 MB). Free memory was 928.4 MB in the beginning and 819.3 MB in the end (delta: 109.1 MB). Peak memory consumption was 514.9 MB. Max. memory is 11.5 GB. * Witness Printer took 100.67 ms. Allocated memory is still 1.5 GB. Free memory was 819.3 MB in the beginning and 801.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...