./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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 64bit --witnessprinter.graph.data.programhash 1f6402fcd9f55b2f1b655eddc673eba49c322fe2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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 64bit --witnessprinter.graph.data.programhash 1f6402fcd9f55b2f1b655eddc673eba49c322fe2 ........................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 02:00:08,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 02:00:08,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 02:00:08,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 02:00:08,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 02:00:08,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 02:00:08,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 02:00:08,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 02:00:08,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 02:00:08,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 02:00:08,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 02:00:08,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 02:00:08,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 02:00:08,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 02:00:08,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 02:00:08,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 02:00:08,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 02:00:08,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 02:00:08,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 02:00:08,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 02:00:08,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 02:00:08,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 02:00:08,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 02:00:08,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 02:00:08,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 02:00:08,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 02:00:08,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 02:00:08,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 02:00:08,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 02:00:08,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 02:00:08,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 02:00:08,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 02:00:08,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 02:00:08,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 02:00:08,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 02:00:08,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 02:00:08,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 02:00:08,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 02:00:08,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 02:00:08,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 02:00:08,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 02:00:08,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-12-02 02:00:08,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 02:00:08,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 02:00:08,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 02:00:08,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 02:00:08,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 02:00:08,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 02:00:08,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 02:00:08,416 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 02:00:08,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 02:00:08,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 02:00:08,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-02 02:00:08,417 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f6402fcd9f55b2f1b655eddc673eba49c322fe2 [2019-12-02 02:00:08,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 02:00:08,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 02:00:08,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 02:00:08,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 02:00:08,544 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 02:00:08,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-12-02 02:00:08,585 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/c18182274/a0232d1470f6416e83a3006b179c0eb0/FLAG6bb67c168 [2019-12-02 02:00:09,227 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 02:00:09,228 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-12-02 02:00:09,244 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/c18182274/a0232d1470f6416e83a3006b179c0eb0/FLAG6bb67c168 [2019-12-02 02:00:09,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/c18182274/a0232d1470f6416e83a3006b179c0eb0 [2019-12-02 02:00:09,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 02:00:09,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 02:00:09,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 02:00:09,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 02:00:09,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 02:00:09,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:00:09" (1/1) ... [2019-12-02 02:00:09,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414b5e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:09, skipping insertion in model container [2019-12-02 02:00:09,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:00:09" (1/1) ... [2019-12-02 02:00:09,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 02:00:09,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 02:00:10,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:00:10,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 02:00:10,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:00:10,384 INFO L208 MainTranslator]: Completed translation [2019-12-02 02:00:10,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10 WrapperNode [2019-12-02 02:00:10,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 02:00:10,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 02:00:10,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 02:00:10,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 02:00:10,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 02:00:10,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 02:00:10,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 02:00:10,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 02:00:10,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... [2019-12-02 02:00:10,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 02:00:10,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 02:00:10,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 02:00:10,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 02:00:10,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:00:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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-02 02:00:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-12-02 02:00:10,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-12-02 02:00:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-02 02:00:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-02 02:00:10,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-02 02:00:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-02 02:00:10,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-02 02:00:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-02 02:00:10,580 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-02 02:00:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-12-02 02:00:10,580 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-12-02 02:00:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-02 02:00:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-12-02 02:00:10,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-12-02 02:00:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-12-02 02:00:10,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-12-02 02:00:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-12-02 02:00:10,581 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-12-02 02:00:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-12-02 02:00:10,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-12-02 02:00:10,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-12-02 02:00:10,582 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-12-02 02:00:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-12-02 02:00:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-12-02 02:00:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-12-02 02:00:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-12-02 02:00:10,583 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-02 02:00:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 02:00:10,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 02:00:10,868 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-12-02 02:00:12,256 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 02:00:12,257 INFO L287 CfgBuilder]: Removed 86 assume(true) statements. [2019-12-02 02:00:12,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:00:12 BoogieIcfgContainer [2019-12-02 02:00:12,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 02:00:12,258 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 02:00:12,258 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 02:00:12,265 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 02:00:12,265 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:00:12" (1/1) ... [2019-12-02 02:00:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 02:00:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 147 states and 204 transitions. [2019-12-02 02:00:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2019-12-02 02:00:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-02 02:00:12,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:12,514 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-02 02:00:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 152 states and 217 transitions. [2019-12-02 02:00:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 217 transitions. [2019-12-02 02:00:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 02:00:12,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 02:00:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 153 states and 218 transitions. [2019-12-02 02:00:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2019-12-02 02:00:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 02:00:12,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 02:00:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 156 states and 229 transitions. [2019-12-02 02:00:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 229 transitions. [2019-12-02 02:00:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 02:00:12,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 02:00:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 155 states and 225 transitions. [2019-12-02 02:00:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2019-12-02 02:00:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 02:00:12,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 166 states and 254 transitions. [2019-12-02 02:00:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 254 transitions. [2019-12-02 02:00:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 02:00:13,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 02:00:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 168 states and 256 transitions. [2019-12-02 02:00:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-02 02:00:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-02 02:00:13,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 180 states and 284 transitions. [2019-12-02 02:00:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2019-12-02 02:00:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 02:00:13,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 02:00:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 179 states and 278 transitions. [2019-12-02 02:00:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-12-02 02:00:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 02:00:13,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 192 states and 306 transitions. [2019-12-02 02:00:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 306 transitions. [2019-12-02 02:00:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 02:00:13,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 193 states and 306 transitions. [2019-12-02 02:00:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-12-02 02:00:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 02:00:13,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 207 states and 335 transitions. [2019-12-02 02:00:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 335 transitions. [2019-12-02 02:00:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-02 02:00:14,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 208 states and 335 transitions. [2019-12-02 02:00:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 335 transitions. [2019-12-02 02:00:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-02 02:00:14,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 02:00:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 212 states and 344 transitions. [2019-12-02 02:00:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 344 transitions. [2019-12-02 02:00:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 02:00:14,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 213 states and 344 transitions. [2019-12-02 02:00:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 344 transitions. [2019-12-02 02:00:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 02:00:14,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 214 states and 344 transitions. [2019-12-02 02:00:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 344 transitions. [2019-12-02 02:00:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 02:00:14,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 215 states and 344 transitions. [2019-12-02 02:00:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 344 transitions. [2019-12-02 02:00:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 02:00:14,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 221 states and 359 transitions. [2019-12-02 02:00:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 359 transitions. [2019-12-02 02:00:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 02:00:15,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 222 states and 359 transitions. [2019-12-02 02:00:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 359 transitions. [2019-12-02 02:00:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 02:00:15,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 228 states and 376 transitions. [2019-12-02 02:00:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 376 transitions. [2019-12-02 02:00:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 02:00:15,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 229 states and 376 transitions. [2019-12-02 02:00:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 376 transitions. [2019-12-02 02:00:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 02:00:15,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 235 states and 393 transitions. [2019-12-02 02:00:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 393 transitions. [2019-12-02 02:00:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 02:00:15,402 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 236 states and 393 transitions. [2019-12-02 02:00:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 393 transitions. [2019-12-02 02:00:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 02:00:15,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 239 states and 406 transitions. [2019-12-02 02:00:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-12-02 02:00:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 02:00:15,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 02:00:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 245 states and 425 transitions. [2019-12-02 02:00:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 425 transitions. [2019-12-02 02:00:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 02:00:16,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 250 states and 444 transitions. [2019-12-02 02:00:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 444 transitions. [2019-12-02 02:00:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 02:00:16,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 02:00:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 253 states and 457 transitions. [2019-12-02 02:00:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 457 transitions. [2019-12-02 02:00:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 02:00:16,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 259 states and 473 transitions. [2019-12-02 02:00:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 473 transitions. [2019-12-02 02:00:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 02:00:17,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 260 states and 473 transitions. [2019-12-02 02:00:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 473 transitions. [2019-12-02 02:00:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 02:00:17,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 266 states and 489 transitions. [2019-12-02 02:00:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 489 transitions. [2019-12-02 02:00:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 02:00:17,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 265 states and 472 transitions. [2019-12-02 02:00:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 472 transitions. [2019-12-02 02:00:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 02:00:17,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 266 states and 472 transitions. [2019-12-02 02:00:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 472 transitions. [2019-12-02 02:00:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 02:00:17,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 268 states and 475 transitions. [2019-12-02 02:00:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 475 transitions. [2019-12-02 02:00:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 02:00:17,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 274 states and 490 transitions. [2019-12-02 02:00:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 490 transitions. [2019-12-02 02:00:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 02:00:18,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 275 states and 490 transitions. [2019-12-02 02:00:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 490 transitions. [2019-12-02 02:00:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 02:00:18,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 277 states and 492 transitions. [2019-12-02 02:00:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 492 transitions. [2019-12-02 02:00:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:18,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 283 states and 508 transitions. [2019-12-02 02:00:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 508 transitions. [2019-12-02 02:00:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:18,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-02 02:00:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 285 states and 511 transitions. [2019-12-02 02:00:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 511 transitions. [2019-12-02 02:00:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:18,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 286 states and 511 transitions. [2019-12-02 02:00:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 511 transitions. [2019-12-02 02:00:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:18,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 288 states and 514 transitions. [2019-12-02 02:00:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 514 transitions. [2019-12-02 02:00:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:19,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 290 states and 516 transitions. [2019-12-02 02:00:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 516 transitions. [2019-12-02 02:00:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 02:00:19,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 292 states and 519 transitions. [2019-12-02 02:00:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 519 transitions. [2019-12-02 02:00:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 02:00:19,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 294 states and 522 transitions. [2019-12-02 02:00:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 522 transitions. [2019-12-02 02:00:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 02:00:19,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 296 states and 524 transitions. [2019-12-02 02:00:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 524 transitions. [2019-12-02 02:00:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-02 02:00:19,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 302 states and 536 transitions. [2019-12-02 02:00:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 536 transitions. [2019-12-02 02:00:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 02:00:19,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 02:00:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 304 states and 538 transitions. [2019-12-02 02:00:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 538 transitions. [2019-12-02 02:00:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 02:00:19,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 308 states and 547 transitions. [2019-12-02 02:00:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 547 transitions. [2019-12-02 02:00:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 02:00:19,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 310 states and 550 transitions. [2019-12-02 02:00:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 550 transitions. [2019-12-02 02:00:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 02:00:19,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 311 states and 551 transitions. [2019-12-02 02:00:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 551 transitions. [2019-12-02 02:00:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 02:00:19,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 317 states and 563 transitions. [2019-12-02 02:00:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 563 transitions. [2019-12-02 02:00:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-02 02:00:19,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-02 02:00:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 318 states and 563 transitions. [2019-12-02 02:00:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 563 transitions. [2019-12-02 02:00:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-02 02:00:19,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 320 states and 565 transitions. [2019-12-02 02:00:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 565 transitions. [2019-12-02 02:00:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 02:00:19,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 321 states and 566 transitions. [2019-12-02 02:00:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 566 transitions. [2019-12-02 02:00:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 02:00:19,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 327 states and 578 transitions. [2019-12-02 02:00:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 578 transitions. [2019-12-02 02:00:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 02:00:19,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-02 02:00:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 328 states and 578 transitions. [2019-12-02 02:00:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-12-02 02:00:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 02:00:19,824 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 329 states and 579 transitions. [2019-12-02 02:00:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-02 02:00:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 02:00:19,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 335 states and 592 transitions. [2019-12-02 02:00:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 592 transitions. [2019-12-02 02:00:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 02:00:19,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 02:00:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 336 states and 592 transitions. [2019-12-02 02:00:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 592 transitions. [2019-12-02 02:00:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 02:00:20,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 338 states and 597 transitions. [2019-12-02 02:00:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 597 transitions. [2019-12-02 02:00:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 02:00:20,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-02 02:00:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 339 states and 597 transitions. [2019-12-02 02:00:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 597 transitions. [2019-12-02 02:00:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-02 02:00:20,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:00:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 340 states and 598 transitions. [2019-12-02 02:00:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 598 transitions. [2019-12-02 02:00:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-02 02:00:20,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 02:00:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 341 states and 598 transitions. [2019-12-02 02:00:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 598 transitions. [2019-12-02 02:00:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 02:00:20,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-02 02:00:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 342 states and 598 transitions. [2019-12-02 02:00:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-02 02:00:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 02:00:20,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 345 states and 602 transitions. [2019-12-02 02:00:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 602 transitions. [2019-12-02 02:00:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 02:00:20,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 348 states and 605 transitions. [2019-12-02 02:00:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 605 transitions. [2019-12-02 02:00:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 02:00:21,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 02:00:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 349 states and 605 transitions. [2019-12-02 02:00:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 605 transitions. [2019-12-02 02:00:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-02 02:00:21,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 352 states and 609 transitions. [2019-12-02 02:00:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 609 transitions. [2019-12-02 02:00:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-02 02:00:21,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 355 states and 612 transitions. [2019-12-02 02:00:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 612 transitions. [2019-12-02 02:00:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-02 02:00:21,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 02:00:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 356 states and 612 transitions. [2019-12-02 02:00:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 612 transitions. [2019-12-02 02:00:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 02:00:21,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 359 states and 616 transitions. [2019-12-02 02:00:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 616 transitions. [2019-12-02 02:00:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 02:00:22,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 362 states and 619 transitions. [2019-12-02 02:00:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 619 transitions. [2019-12-02 02:00:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-02 02:00:22,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 367 states and 626 transitions. [2019-12-02 02:00:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2019-12-02 02:00:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-02 02:00:23,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 02:00:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 368 states and 626 transitions. [2019-12-02 02:00:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 626 transitions. [2019-12-02 02:00:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-02 02:00:23,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-02 02:00:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 370 states and 628 transitions. [2019-12-02 02:00:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 628 transitions. [2019-12-02 02:00:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 02:00:23,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 02:00:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 388 states and 676 transitions. [2019-12-02 02:00:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 676 transitions. [2019-12-02 02:00:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 02:00:24,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 02:00:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 391 states and 683 transitions. [2019-12-02 02:00:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 683 transitions. [2019-12-02 02:00:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 02:00:24,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 02:00:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 392 states and 684 transitions. [2019-12-02 02:00:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 684 transitions. [2019-12-02 02:00:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-02 02:00:24,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-02 02:00:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 402 states and 708 transitions. [2019-12-02 02:00:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 708 transitions. [2019-12-02 02:00:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-02 02:00:25,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-02 02:00:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 407 states and 720 transitions. [2019-12-02 02:00:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 720 transitions. [2019-12-02 02:00:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-02 02:00:26,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-02 02:00:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 408 states and 721 transitions. [2019-12-02 02:00:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 721 transitions. [2019-12-02 02:00:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 02:00:26,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 424 states and 757 transitions. [2019-12-02 02:00:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 757 transitions. [2019-12-02 02:00:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 02:00:30,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-02 02:00:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 426 states and 759 transitions. [2019-12-02 02:00:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 759 transitions. [2019-12-02 02:00:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 02:00:30,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-02 02:00:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 442 states and 795 transitions. [2019-12-02 02:00:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 795 transitions. [2019-12-02 02:00:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-02 02:00:32,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 02:00:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 443 states and 796 transitions. [2019-12-02 02:00:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 796 transitions. [2019-12-02 02:00:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 02:00:32,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 445 states and 799 transitions. [2019-12-02 02:00:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 799 transitions. [2019-12-02 02:00:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-02 02:00:32,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-02 02:00:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 447 states and 802 transitions. [2019-12-02 02:00:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 802 transitions. [2019-12-02 02:00:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 02:00:32,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 449 states and 805 transitions. [2019-12-02 02:00:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 805 transitions. [2019-12-02 02:00:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-02 02:00:32,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 450 states and 805 transitions. [2019-12-02 02:00:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 805 transitions. [2019-12-02 02:00:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 02:00:33,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 452 states and 808 transitions. [2019-12-02 02:00:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 808 transitions. [2019-12-02 02:00:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-02 02:00:33,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 02:00:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 457 states and 821 transitions. [2019-12-02 02:00:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 821 transitions. [2019-12-02 02:00:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 02:00:33,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 02:00:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 459 states and 824 transitions. [2019-12-02 02:00:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 824 transitions. [2019-12-02 02:00:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 02:00:33,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 02:00:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 461 states and 826 transitions. [2019-12-02 02:00:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 826 transitions. [2019-12-02 02:00:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 02:00:34,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-02 02:00:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 462 states and 826 transitions. [2019-12-02 02:00:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 826 transitions. [2019-12-02 02:00:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 02:00:34,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 477 states and 864 transitions. [2019-12-02 02:00:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 864 transitions. [2019-12-02 02:00:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 02:00:35,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-02 02:00:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 478 states and 864 transitions. [2019-12-02 02:00:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 864 transitions. [2019-12-02 02:00:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 02:00:35,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 02:00:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 482 states and 870 transitions. [2019-12-02 02:00:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 870 transitions. [2019-12-02 02:00:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 02:00:35,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 483 states and 870 transitions. [2019-12-02 02:00:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 870 transitions. [2019-12-02 02:00:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 02:00:36,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 484 states and 870 transitions. [2019-12-02 02:00:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 870 transitions. [2019-12-02 02:00:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 02:00:36,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 485 states and 872 transitions. [2019-12-02 02:00:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 872 transitions. [2019-12-02 02:00:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 02:00:36,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-02 02:00:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 486 states and 872 transitions. [2019-12-02 02:00:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 872 transitions. [2019-12-02 02:00:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 02:00:36,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 487 states and 872 transitions. [2019-12-02 02:00:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 872 transitions. [2019-12-02 02:00:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 02:00:37,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 488 states and 872 transitions. [2019-12-02 02:00:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 872 transitions. [2019-12-02 02:00:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 02:00:37,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 503 states and 898 transitions. [2019-12-02 02:00:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 898 transitions. [2019-12-02 02:00:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 02:00:37,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 508 states and 906 transitions. [2019-12-02 02:00:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 906 transitions. [2019-12-02 02:00:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-02 02:00:37,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 509 states and 906 transitions. [2019-12-02 02:00:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 906 transitions. [2019-12-02 02:00:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-02 02:00:37,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-02 02:00:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 510 states and 906 transitions. [2019-12-02 02:00:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 906 transitions. [2019-12-02 02:00:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-02 02:00:38,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 525 states and 932 transitions. [2019-12-02 02:00:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 932 transitions. [2019-12-02 02:00:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-02 02:00:38,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 530 states and 940 transitions. [2019-12-02 02:00:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 940 transitions. [2019-12-02 02:00:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 02:00:38,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 531 states and 941 transitions. [2019-12-02 02:00:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 941 transitions. [2019-12-02 02:00:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 02:00:38,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 532 states and 942 transitions. [2019-12-02 02:00:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 942 transitions. [2019-12-02 02:00:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 02:00:38,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 547 states and 968 transitions. [2019-12-02 02:00:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 968 transitions. [2019-12-02 02:00:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 02:00:38,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 552 states and 976 transitions. [2019-12-02 02:00:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 976 transitions. [2019-12-02 02:00:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 02:00:38,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 553 states and 977 transitions. [2019-12-02 02:00:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 977 transitions. [2019-12-02 02:00:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 02:00:38,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 554 states and 978 transitions. [2019-12-02 02:00:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 978 transitions. [2019-12-02 02:00:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 02:00:38,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 569 states and 1004 transitions. [2019-12-02 02:00:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1004 transitions. [2019-12-02 02:00:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 02:00:38,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 574 states and 1012 transitions. [2019-12-02 02:00:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1012 transitions. [2019-12-02 02:00:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 02:00:38,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 575 states and 1013 transitions. [2019-12-02 02:00:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1013 transitions. [2019-12-02 02:00:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 02:00:38,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 576 states and 1014 transitions. [2019-12-02 02:00:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1014 transitions. [2019-12-02 02:00:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 02:00:38,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 02:00:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 579 states and 1018 transitions. [2019-12-02 02:00:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1018 transitions. [2019-12-02 02:00:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 02:00:38,824 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 580 states and 1019 transitions. [2019-12-02 02:00:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1019 transitions. [2019-12-02 02:00:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 02:00:38,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-02 02:00:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 581 states and 1020 transitions. [2019-12-02 02:00:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1020 transitions. [2019-12-02 02:00:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 02:00:38,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 02:00:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 584 states and 1024 transitions. [2019-12-02 02:00:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1024 transitions. [2019-12-02 02:00:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 02:00:38,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 02:00:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 587 states and 1028 transitions. [2019-12-02 02:00:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1028 transitions. [2019-12-02 02:00:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-02 02:00:39,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 02:00:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 590 states and 1032 transitions. [2019-12-02 02:00:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1032 transitions. [2019-12-02 02:00:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-02 02:00:39,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-02 02:00:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 596 states and 1041 transitions. [2019-12-02 02:00:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1041 transitions. [2019-12-02 02:00:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-02 02:00:39,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-02 02:00:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 602 states and 1051 transitions. [2019-12-02 02:00:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1051 transitions. [2019-12-02 02:00:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-02 02:00:40,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-02 02:00:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 608 states and 1061 transitions. [2019-12-02 02:00:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1061 transitions. [2019-12-02 02:00:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-02 02:00:40,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-02 02:00:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 614 states and 1071 transitions. [2019-12-02 02:00:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1071 transitions. [2019-12-02 02:00:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-02 02:00:41,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-02 02:00:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 657 states and 1164 transitions. [2019-12-02 02:00:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1164 transitions. [2019-12-02 02:00:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-02 02:00:44,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-02 02:00:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 662 states and 1172 transitions. [2019-12-02 02:00:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1172 transitions. [2019-12-02 02:00:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 02:00:44,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-02 02:00:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 677 states and 1199 transitions. [2019-12-02 02:00:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1199 transitions. [2019-12-02 02:00:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 02:00:45,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-02 02:00:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 678 states and 1200 transitions. [2019-12-02 02:00:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1200 transitions. [2019-12-02 02:00:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 02:00:45,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-02 02:00:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 679 states and 1201 transitions. [2019-12-02 02:00:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1201 transitions. [2019-12-02 02:00:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-02 02:00:45,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-02 02:00:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 694 states and 1228 transitions. [2019-12-02 02:00:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1228 transitions. [2019-12-02 02:00:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 02:00:45,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-02 02:00:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 709 states and 1255 transitions. [2019-12-02 02:00:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1255 transitions. [2019-12-02 02:00:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 02:00:46,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-02 02:00:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:00:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 711 states and 1265 transitions. [2019-12-02 02:00:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1265 transitions. [2019-12-02 02:00:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 02:00:47,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:00:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:47,505 ERROR L603 CodeCheckObserver]: First Tracecheck threw exception Undeclared function symbol (const Int) [2019-12-02 02:00:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:00:47,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 121 conjunts are in the unsatisfiable core [2019-12-02 02:00:47,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-02 02:00:47,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-02 02:00:47,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:47,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:47,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-02 02:00:47,755 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-12-02 02:00:48,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-12-02 02:00:48,098 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:48,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:48,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-02 02:00:48,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-12-02 02:00:49,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-02 02:00:49,409 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:49,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:49,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-02 02:00:49,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-12-02 02:00:50,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:50,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-02 02:00:50,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:50,850 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-02 02:00:50,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-02 02:00:50,854 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:50,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:50,862 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-02 02:00:50,862 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2019-12-02 02:00:51,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-02 02:00:51,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:00:51,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:00:51,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-02 02:00:51,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-12-02 02:01:11,576 WARN L192 SmtUtils]: Spent 10.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-12-02 02:02:04,774 WARN L192 SmtUtils]: Spent 51.91 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-02 02:02:04,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:02:04,814 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:02:04,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-02 02:02:04,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:02:04,915 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-02 02:02:04,916 INFO L614 ElimStorePlain]: treesize reduction 28, result has 82.1 percent of original size [2019-12-02 02:02:04,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-12-02 02:02:04,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:126, output treesize:128 [2019-12-02 02:02:08,124 INFO L430 ElimStorePlain]: Different costs {1=[v_prenex_9], 3=[|v_#valid_BEFORE_CALL_5|]} [2019-12-02 02:02:08,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-02 02:02:08,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:02:08,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:02:08,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-12-02 02:02:08,161 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:02:08,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:02:08,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-02 02:02:08,185 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:91, output treesize:66 [2019-12-02 02:02:55,529 WARN L192 SmtUtils]: Spent 35.24 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-02 02:03:17,076 WARN L192 SmtUtils]: Spent 20.03 s on a formula simplification that was a NOOP. DAG size: 46 [2019-12-02 02:03:17,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:17,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:17,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:17,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-12-02 02:03:17,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:17,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:17,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-02 02:03:17,179 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:17,516 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-12-02 02:03:17,516 INFO L614 ElimStorePlain]: treesize reduction 70, result has 81.5 percent of original size [2019-12-02 02:03:17,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-12-02 02:03:17,518 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:301, output treesize:309 [2019-12-02 02:03:18,581 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-12-02 02:03:19,417 INFO L430 ElimStorePlain]: Different costs {1=[v_prenex_29], 3=[v_prenex_23, |v_#valid_BEFORE_CALL_9|], 6=[v_prenex_27]} [2019-12-02 02:03:19,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-02 02:03:19,423 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:19,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:19,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-12-02 02:03:19,525 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:19,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:19,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-12-02 02:03:19,620 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:19,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:19,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-12-02 02:03:19,708 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:19,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:19,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-12-02 02:03:19,785 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:229, output treesize:169 [2019-12-02 02:03:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-02 02:03:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:30,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:03:30,754 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_12|], 3=[v_prenex_35, v_prenex_37, v_prenex_41], 6=[v_prenex_45, v_prenex_39, v_prenex_53], 10=[v_prenex_50]} [2019-12-02 02:03:30,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-02 02:03:30,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:31,075 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 235 [2019-12-02 02:03:31,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:31,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:31,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-02 02:03:31,092 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:31,447 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2019-12-02 02:03:31,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:31,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-12-02 02:03:31,456 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:31,757 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 225 [2019-12-02 02:03:31,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:31,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-12-02 02:03:31,767 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:32,271 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2019-12-02 02:03:32,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:32,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:32,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-12-02 02:03:32,317 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:32,706 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2019-12-02 02:03:32,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:32,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-12-02 02:03:32,715 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:33,001 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2019-12-02 02:03:33,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:33,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:33,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-12-02 02:03:33,030 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:33,452 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2019-12-02 02:03:33,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:33,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:33,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-12-02 02:03:33,480 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-02 02:03:33,776 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-02 02:03:33,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:03:33,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2019-12-02 02:03:33,779 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 32 variables, input treesize:649, output treesize:557 [2019-12-02 02:06:15,316 WARN L192 SmtUtils]: Spent 2.67 m on a formula simplification. DAG size of input: 221 DAG size of output: 125 [2019-12-02 02:09:06,307 WARN L192 SmtUtils]: Spent 2.67 m on a formula simplification that was a NOOP. DAG size: 125 [2019-12-02 02:09:16,327 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5 Int) (v_prenex_36 Int) (v_prenex_57 Int)) (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |c_#memory_int| v_prenex_36)) (not (= v_prenex_57 v_prenex_36)) (not (= v_prenex_57 0)) (not (= v_prenex_57 v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5)) (not (= v_prenex_36 v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5)) (= .cse0 (select |c_#memory_int| v_prenex_57)) (not (= (mod v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5 18446744073709551616) 0))))) (exists ((v_prenex_40 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (= .cse1 (select |c_#memory_int| v_prenex_71)) (not (= v_prenex_71 v_prenex_72)) (not (= v_prenex_71 v_prenex_40)) (not (= v_prenex_72 v_prenex_40)) (not (= 0 (mod v_prenex_72 18446744073709551616))) (not (= v_prenex_71 0)) (= .cse1 (select |c_#memory_int| v_prenex_40))))) (exists ((v_prenex_15 Int) (v_prenex_59 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (= .cse2 (select |c_#memory_int| v_prenex_15)) (not (= v_prenex_61 v_prenex_59)) (not (= v_prenex_61 v_prenex_15)) (not (= v_prenex_59 v_prenex_60)) (not (= (mod v_prenex_59 18446744073709551616) 0)) (not (= v_prenex_61 0)) (not (= v_prenex_61 v_prenex_60)) (not (= v_prenex_15 v_prenex_60)) (not (= 0 (mod v_prenex_60 18446744073709551616))) (= .cse2 (select |c_#memory_int| v_prenex_61)) (not (= v_prenex_15 v_prenex_59))))) (exists ((v_prenex_4 Int) (v_prenex_58 Int) (v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 Int) (v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 Int)) (let ((.cse3 ((as const (Array Int Int)) 0))) (and (not (= v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 v_prenex_4)) (not (= v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 v_prenex_4)) (not (= v_prenex_58 0)) (not (= v_prenex_58 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1)) (not (= v_prenex_58 v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2)) (not (= v_prenex_58 v_prenex_4)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 18446744073709551616))) (= .cse3 (select |c_#memory_int| v_prenex_58)) (= .cse3 (select |c_#memory_int| v_prenex_4)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 18446744073709551616))) (not (= v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1))))) (exists ((v_prenex_16 Int) (v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 Int)) (let ((.cse4 ((as const (Array Int Int)) 0))) (and (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 0)) (= (select |c_#memory_int| v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6) .cse4) (= .cse4 (select |c_#memory_int| v_prenex_16)) (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 v_prenex_16))))) (exists ((v_prenex_38 Int) (v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_70 Int)) (let ((.cse5 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_69 0)) (not (= v_prenex_38 v_prenex_68)) (= .cse5 (select |c_#memory_int| v_prenex_69)) (not (= v_prenex_69 v_prenex_38)) (not (= v_prenex_69 v_prenex_68)) (not (= v_prenex_70 v_prenex_38)) (= .cse5 (select |c_#memory_int| v_prenex_38)) (not (= v_prenex_70 v_prenex_68)) (not (= v_prenex_69 v_prenex_70)) (not (= (mod v_prenex_68 18446744073709551616) 0)) (not (= 0 (mod v_prenex_70 18446744073709551616)))))) (exists ((v_prenex_34 Int) (v_prenex_63 Int) (v_prenex_62 Int)) (let ((.cse6 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_62 v_prenex_63)) (not (= v_prenex_62 v_prenex_34)) (not (= v_prenex_34 v_prenex_63)) (= (select |c_#memory_int| v_prenex_34) .cse6) (not (= v_prenex_62 0)) (not (= 0 (mod v_prenex_63 18446744073709551616))) (= .cse6 (select |c_#memory_int| v_prenex_62))))) (exists ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_64 Int) (v_prenex_19 Int)) (let ((.cse7 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_19 v_prenex_66)) (not (= v_prenex_65 v_prenex_64)) (not (= v_prenex_64 v_prenex_66)) (not (= v_prenex_67 v_prenex_64)) (not (= 0 (mod v_prenex_66 18446744073709551616))) (not (= v_prenex_65 v_prenex_67)) (= (select |c_#memory_int| v_prenex_19) .cse7) (not (= v_prenex_65 0)) (not (= v_prenex_19 v_prenex_64)) (not (= v_prenex_67 v_prenex_19)) (not (= (mod v_prenex_64 18446744073709551616) 0)) (not (= v_prenex_67 v_prenex_66)) (not (= 0 (mod v_prenex_67 18446744073709551616))) (not (= v_prenex_65 v_prenex_19)) (not (= v_prenex_65 v_prenex_66)) (= .cse7 (select |c_#memory_int| v_prenex_65)))))) is different from true [2019-12-02 02:09:18,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-02 02:09:18,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2019-12-02 02:09:18,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-12-02 02:09:18,404 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-02 02:09:18,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:09:18,408 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-02 02:09:18,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-02 02:09:18,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 68 [2019-12-02 02:09:18,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:09:18,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:09:18,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-02 02:09:18,447 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.aggregateBenchmarkData(StatisticsData.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.addTraceCheckData(CegarLoopStatisticsGenerator.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:460) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-02 02:09:18,450 INFO L168 Benchmark]: Toolchain (without parser) took 548859.42 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 952.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -309.5 MB). Peak memory consumption was 643.1 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,450 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 02:09:18,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,451 INFO L168 Benchmark]: Boogie Preprocessor took 71.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,451 INFO L168 Benchmark]: RCFGBuilder took 1723.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,451 INFO L168 Benchmark]: CodeCheck took 546191.07 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 826.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -180.0 MB). Peak memory consumption was 646.8 MB. Max. memory is 11.5 GB. [2019-12-02 02:09:18,453 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: NullPointerException: null: de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.aggregateBenchmarkData(StatisticsData.java:68) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 790.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1723.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. * CodeCheck took 546191.07 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 826.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -180.0 MB). Peak memory consumption was 646.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-02 02:09:19,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 02:09:19,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 02:09:19,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 02:09:19,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 02:09:19,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 02:09:19,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 02:09:19,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 02:09:19,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 02:09:19,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 02:09:19,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 02:09:19,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 02:09:19,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 02:09:19,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 02:09:19,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 02:09:19,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 02:09:19,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 02:09:19,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 02:09:19,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 02:09:19,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 02:09:19,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 02:09:19,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 02:09:19,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 02:09:19,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 02:09:19,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 02:09:19,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 02:09:19,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 02:09:19,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 02:09:19,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 02:09:19,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 02:09:19,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 02:09:19,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 02:09:19,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 02:09:19,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 02:09:19,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 02:09:19,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 02:09:19,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 02:09:19,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 02:09:19,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 02:09:19,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 02:09:19,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 02:09:19,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-12-02 02:09:19,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 02:09:19,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 02:09:19,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 02:09:19,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 02:09:19,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 02:09:19,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 02:09:19,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-02 02:09:19,862 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 02:09:19,863 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 02:09:19,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 02:09:19,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 02:09:19,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-12-02 02:09:19,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-02 02:09:19,865 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-02 02:09:19,865 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f6402fcd9f55b2f1b655eddc673eba49c322fe2 [2019-12-02 02:09:20,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 02:09:20,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 02:09:20,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 02:09:20,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 02:09:20,041 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 02:09:20,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-12-02 02:09:20,089 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/9817bbf47/795f28e09c2447cd8d05ef7c5d5de9f6/FLAG64466c32c [2019-12-02 02:09:20,537 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 02:09:20,537 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-12-02 02:09:20,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/9817bbf47/795f28e09c2447cd8d05ef7c5d5de9f6/FLAG64466c32c [2019-12-02 02:09:20,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/bin/ukojak/data/9817bbf47/795f28e09c2447cd8d05ef7c5d5de9f6 [2019-12-02 02:09:20,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 02:09:20,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 02:09:20,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 02:09:20,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 02:09:20,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 02:09:20,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:20" (1/1) ... [2019-12-02 02:09:20,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf3dd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:20, skipping insertion in model container [2019-12-02 02:09:20,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:20" (1/1) ... [2019-12-02 02:09:20,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 02:09:20,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 02:09:21,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:09:21,117 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-02 02:09:21,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 02:09:21,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:09:21,222 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 02:09:21,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:09:21,361 INFO L208 MainTranslator]: Completed translation [2019-12-02 02:09:21,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21 WrapperNode [2019-12-02 02:09:21,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 02:09:21,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 02:09:21,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 02:09:21,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 02:09:21,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 02:09:21,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 02:09:21,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 02:09:21,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 02:09:21,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... [2019-12-02 02:09:21,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 02:09:21,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 02:09:21,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 02:09:21,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 02:09:21,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b2db987-3f9c-4754-b294-1aeeefbed984/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-02 02:09:21,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-02 02:09:21,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-02 02:09:21,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-02 02:09:21,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-12-02 02:09:21,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-12-02 02:09:21,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-12-02 02:09:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-02 02:09:21,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-02 02:09:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-02 02:09:21,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-02 02:09:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-02 02:09:21,542 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-02 02:09:21,542 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-12-02 02:09:21,543 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-12-02 02:09:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-12-02 02:09:21,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-12-02 02:09:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-12-02 02:09:21,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-12-02 02:09:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-12-02 02:09:21,543 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-12-02 02:09:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-12-02 02:09:21,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-12-02 02:09:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-02 02:09:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-12-02 02:09:21,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-12-02 02:09:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-02 02:09:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 02:09:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-12-02 02:09:21,545 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-12-02 02:09:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-12-02 02:09:21,545 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-12-02 02:09:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-12-02 02:09:21,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-12-02 02:09:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-12-02 02:09:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-12-02 02:09:21,547 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-12-02 02:09:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-12-02 02:09:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-02 02:09:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-12-02 02:09:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-12-02 02:09:21,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-12-02 02:09:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 02:09:21,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 02:09:21,922 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-12-02 02:10:11,557 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 02:10:11,557 INFO L287 CfgBuilder]: Removed 86 assume(true) statements. [2019-12-02 02:10:11,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:10:11 BoogieIcfgContainer [2019-12-02 02:10:11,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 02:10:11,558 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 02:10:11,558 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 02:10:11,565 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 02:10:11,565 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:10:11" (1/1) ... [2019-12-02 02:10:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 02:10:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:10:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 147 states and 204 transitions. [2019-12-02 02:10:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2019-12-02 02:10:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-02 02:10:11,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:10:11,639 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort BitVec not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableSortSymbol.defineOrDeclare(DeclarableSortSymbol.java:79) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:170) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferAllSymbols(SmtFunctionsAndAxioms.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:448) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-02 02:10:11,643 INFO L168 Benchmark]: Toolchain (without parser) took 51075.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,643 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 02:10:11,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.4 MB in the beginning and 1.0 GB in the end (delta: -74.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,644 INFO L168 Benchmark]: Boogie Preprocessor took 60.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,645 INFO L168 Benchmark]: RCFGBuilder took 50069.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). Peak memory consumption was 230.2 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,646 INFO L168 Benchmark]: CodeCheck took 83.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-12-02 02:10:11,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: SMTLIBException: Sort BitVec not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 794.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.4 MB in the beginning and 1.0 GB in the end (delta: -74.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 50069.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). Peak memory consumption was 230.2 MB. Max. memory is 11.5 GB. * CodeCheck took 83.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...