./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 03:00:42,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 03:00:42,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 03:00:42,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 03:00:42,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 03:00:42,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 03:00:42,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 03:00:42,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 03:00:42,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 03:00:42,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 03:00:42,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 03:00:42,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 03:00:42,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 03:00:42,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 03:00:42,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 03:00:42,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 03:00:42,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 03:00:42,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 03:00:42,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 03:00:42,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 03:00:42,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 03:00:42,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 03:00:42,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 03:00:42,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 03:00:42,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 03:00:42,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 03:00:42,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 03:00:42,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 03:00:42,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 03:00:42,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 03:00:42,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 03:00:42,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 03:00:42,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 03:00:42,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 03:00:42,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 03:00:42,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 03:00:42,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 03:00:42,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 03:00:42,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 03:00:42,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 03:00:42,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 03:00:42,511 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2019-12-02 03:00:42,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 03:00:42,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 03:00:42,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 03:00:42,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 03:00:42,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 03:00:42,522 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 03:00:42,523 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 03:00:42,523 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 03:00:42,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 03:00:42,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 03:00:42,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 03:00:42,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 03:00:42,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 03:00:42,524 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 03:00:42,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 03:00:42,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2019-12-02 03:00:42,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 03:00:42,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 03:00:42,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 03:00:42,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 03:00:42,638 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 03:00:42,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-12-02 03:00:42,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/data/583647717/8dc62f18f981473ebf4c8f8aea26d36c/FLAGcef6b4efe [2019-12-02 03:00:43,125 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 03:00:43,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-12-02 03:00:43,129 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/data/583647717/8dc62f18f981473ebf4c8f8aea26d36c/FLAGcef6b4efe [2019-12-02 03:00:43,138 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/data/583647717/8dc62f18f981473ebf4c8f8aea26d36c [2019-12-02 03:00:43,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 03:00:43,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 03:00:43,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 03:00:43,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 03:00:43,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 03:00:43,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43, skipping insertion in model container [2019-12-02 03:00:43,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 03:00:43,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 03:00:43,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:00:43,329 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 03:00:43,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:00:43,355 INFO L208 MainTranslator]: Completed translation [2019-12-02 03:00:43,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43 WrapperNode [2019-12-02 03:00:43,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 03:00:43,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 03:00:43,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 03:00:43,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 03:00:43,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 03:00:43,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 03:00:43,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 03:00:43,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 03:00:43,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 03:00:43,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 03:00:43,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 03:00:43,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 03:00:43,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:00:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/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 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-02 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-02 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 03:00:43,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-02 03:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 03:00:43,746 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 03:00:43,746 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-02 03:00:43,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:00:43 BoogieIcfgContainer [2019-12-02 03:00:43,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 03:00:43,747 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 03:00:43,747 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 03:00:43,754 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 03:00:43,754 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:00:43" (1/1) ... [2019-12-02 03:00:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 03:00:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 33 states and 37 transitions. [2019-12-02 03:00:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-02 03:00:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-02 03:00:43,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:43,899 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 03:00:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 32 states and 36 transitions. [2019-12-02 03:00:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-12-02 03:00:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-02 03:00:43,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:43,964 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 03:00:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 34 states and 38 transitions. [2019-12-02 03:00:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-12-02 03:00:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-02 03:00:44,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 36 states and 42 transitions. [2019-12-02 03:00:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-12-02 03:00:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-02 03:00:44,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 37 states and 44 transitions. [2019-12-02 03:00:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-12-02 03:00:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-02 03:00:44,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 41 states and 52 transitions. [2019-12-02 03:00:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-12-02 03:00:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-02 03:00:45,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 43 states and 54 transitions. [2019-12-02 03:00:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-12-02 03:00:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 03:00:45,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 46 states and 63 transitions. [2019-12-02 03:00:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-12-02 03:00:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-02 03:00:46,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 48 states and 67 transitions. [2019-12-02 03:00:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2019-12-02 03:00:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-02 03:00:46,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 49 states and 68 transitions. [2019-12-02 03:00:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2019-12-02 03:00:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-02 03:00:46,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:47,548 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-02 03:00:48,257 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-02 03:00:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 52 states and 80 transitions. [2019-12-02 03:00:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2019-12-02 03:00:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-02 03:00:48,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 54 states and 82 transitions. [2019-12-02 03:00:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2019-12-02 03:00:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-02 03:00:49,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2019-12-02 03:00:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2019-12-02 03:00:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-02 03:00:50,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 59 states and 99 transitions. [2019-12-02 03:00:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 99 transitions. [2019-12-02 03:00:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-02 03:00:50,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:51,860 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-02 03:00:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 62 states and 116 transitions. [2019-12-02 03:00:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 116 transitions. [2019-12-02 03:00:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-02 03:00:52,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 64 states and 117 transitions. [2019-12-02 03:00:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 117 transitions. [2019-12-02 03:00:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-02 03:00:53,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 67 states and 142 transitions. [2019-12-02 03:00:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 142 transitions. [2019-12-02 03:00:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-02 03:00:55,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 69 states and 142 transitions. [2019-12-02 03:00:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 142 transitions. [2019-12-02 03:00:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-02 03:00:56,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:00:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 70 states and 142 transitions. [2019-12-02 03:00:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2019-12-02 03:00:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-02 03:00:57,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:00:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:00:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:00:59,092 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-02 03:01:00,022 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-02 03:01:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 73 states and 166 transitions. [2019-12-02 03:01:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 166 transitions. [2019-12-02 03:01:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-02 03:01:00,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 75 states and 166 transitions. [2019-12-02 03:01:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 166 transitions. [2019-12-02 03:01:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-02 03:01:01,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 76 states and 166 transitions. [2019-12-02 03:01:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 166 transitions. [2019-12-02 03:01:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 03:01:02,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 79 states and 189 transitions. [2019-12-02 03:01:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2019-12-02 03:01:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 03:01:04,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 81 states and 189 transitions. [2019-12-02 03:01:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2019-12-02 03:01:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 03:01:05,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 82 states and 189 transitions. [2019-12-02 03:01:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 189 transitions. [2019-12-02 03:01:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 03:01:05,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 91 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 84 states and 191 transitions. [2019-12-02 03:01:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 191 transitions. [2019-12-02 03:01:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-02 03:01:08,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 52 states and 58 transitions. [2019-12-02 03:01:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-12-02 03:01:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-02 03:01:13,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-02 03:01:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 54 states and 61 transitions. [2019-12-02 03:01:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-12-02 03:01:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 03:01:14,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2019-12-02 03:01:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-12-02 03:01:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 03:01:23,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:25,149 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-12-02 03:01:26,595 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-02 03:01:26,809 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-02 03:01:30,629 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-12-02 03:01:32,191 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-02 03:01:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 59 states and 70 transitions. [2019-12-02 03:01:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-12-02 03:01:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 03:01:36,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 60 states and 73 transitions. [2019-12-02 03:01:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2019-12-02 03:01:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 03:01:38,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:01:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 64 states and 85 transitions. [2019-12-02 03:01:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2019-12-02 03:01:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 03:01:46,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 65 states and 85 transitions. [2019-12-02 03:01:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2019-12-02 03:01:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 03:01:47,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 67 states and 90 transitions. [2019-12-02 03:01:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2019-12-02 03:01:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 03:01:48,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 68 states and 92 transitions. [2019-12-02 03:01:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2019-12-02 03:01:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 03:01:50,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 70 states and 98 transitions. [2019-12-02 03:01:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-12-02 03:01:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 03:01:54,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 70 states and 97 transitions. [2019-12-02 03:01:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2019-12-02 03:01:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 03:01:55,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:01:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 71 states and 98 transitions. [2019-12-02 03:01:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2019-12-02 03:01:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 03:01:57,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:01:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:01:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:01:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 71 states and 97 transitions. [2019-12-02 03:01:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2019-12-02 03:01:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 03:01:58,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:01:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:02:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 74 states and 111 transitions. [2019-12-02 03:02:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2019-12-02 03:02:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 03:02:07,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:02:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 75 states and 111 transitions. [2019-12-02 03:02:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2019-12-02 03:02:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:08,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 78 states and 121 transitions. [2019-12-02 03:02:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2019-12-02 03:02:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:14,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-02 03:02:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 78 states and 120 transitions. [2019-12-02 03:02:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2019-12-02 03:02:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:15,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:18,003 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-02 03:02:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 81 states and 125 transitions. [2019-12-02 03:02:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2019-12-02 03:02:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:20,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 82 states and 128 transitions. [2019-12-02 03:02:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2019-12-02 03:02:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:22,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 84 states and 134 transitions. [2019-12-02 03:02:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-12-02 03:02:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-02 03:02:25,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:02:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 85 states and 135 transitions. [2019-12-02 03:02:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2019-12-02 03:02:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 03:02:28,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:02:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 86 states and 135 transitions. [2019-12-02 03:02:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 135 transitions. [2019-12-02 03:02:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 03:02:31,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 89 states and 142 transitions. [2019-12-02 03:02:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2019-12-02 03:02:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 03:02:36,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-02 03:02:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 90 states and 143 transitions. [2019-12-02 03:02:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2019-12-02 03:02:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 03:02:37,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 91 states and 144 transitions. [2019-12-02 03:02:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2019-12-02 03:02:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 03:02:38,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 92 states and 144 transitions. [2019-12-02 03:02:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2019-12-02 03:02:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 03:02:39,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:44,128 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-02 03:02:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 94 states and 148 transitions. [2019-12-02 03:02:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2019-12-02 03:02:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 03:02:46,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:47,243 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-02 03:02:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 95 states and 149 transitions. [2019-12-02 03:02:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2019-12-02 03:02:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-02 03:02:48,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-02 03:02:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 96 states and 151 transitions. [2019-12-02 03:02:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2019-12-02 03:02:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-02 03:02:53,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:02:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:02:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 99 states and 158 transitions. [2019-12-02 03:02:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2019-12-02 03:02:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-02 03:02:59,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:02:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:02:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:03:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 101 states and 159 transitions. [2019-12-02 03:03:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2019-12-02 03:03:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 03:03:01,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-02 03:03:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 104 states and 164 transitions. [2019-12-02 03:03:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2019-12-02 03:03:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 03:03:07,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 123 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:03:11,911 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-12-02 03:03:16,035 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-12-02 03:03:20,099 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-02 03:03:22,726 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-02 03:03:26,668 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-02 03:03:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 115 states and 184 transitions. [2019-12-02 03:03:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2019-12-02 03:03:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 03:03:37,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 123 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:03:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 119 states and 187 transitions. [2019-12-02 03:03:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 187 transitions. [2019-12-02 03:03:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 03:03:42,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-02 03:03:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 119 states and 186 transitions. [2019-12-02 03:03:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 186 transitions. [2019-12-02 03:03:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 03:03:43,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-02 03:03:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 124 states and 203 transitions. [2019-12-02 03:03:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 203 transitions. [2019-12-02 03:03:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 03:03:55,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-02 03:03:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:03:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 125 states and 204 transitions. [2019-12-02 03:03:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2019-12-02 03:03:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 03:03:58,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:03:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:03:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 128 states and 209 transitions. [2019-12-02 03:04:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 209 transitions. [2019-12-02 03:04:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 03:04:06,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 130 states and 213 transitions. [2019-12-02 03:04:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 213 transitions. [2019-12-02 03:04:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 03:04:08,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 142 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:04:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 131 states and 214 transitions. [2019-12-02 03:04:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 214 transitions. [2019-12-02 03:04:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 03:04:13,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:17,825 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-02 03:04:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 134 states and 220 transitions. [2019-12-02 03:04:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 220 transitions. [2019-12-02 03:04:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 03:04:19,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:23,496 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-02 03:04:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 136 states and 224 transitions. [2019-12-02 03:04:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 224 transitions. [2019-12-02 03:04:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 03:04:25,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 164 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:04:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 139 states and 229 transitions. [2019-12-02 03:04:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 229 transitions. [2019-12-02 03:04:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 03:04:31,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 164 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:04:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 140 states and 229 transitions. [2019-12-02 03:04:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2019-12-02 03:04:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-02 03:04:32,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 143 states and 234 transitions. [2019-12-02 03:04:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 234 transitions. [2019-12-02 03:04:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-02 03:04:42,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-02 03:04:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 145 states and 238 transitions. [2019-12-02 03:04:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 238 transitions. [2019-12-02 03:04:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 03:04:47,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 189 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:04:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 149 states and 244 transitions. [2019-12-02 03:04:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 244 transitions. [2019-12-02 03:04:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 03:04:55,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 189 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:04:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:04:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2019-12-02 03:04:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2019-12-02 03:04:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 03:04:57,983 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:04:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:04:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-02 03:05:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 152 states and 247 transitions. [2019-12-02 03:05:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 247 transitions. [2019-12-02 03:05:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 03:05:04,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-02 03:05:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 155 states and 254 transitions. [2019-12-02 03:05:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 254 transitions. [2019-12-02 03:05:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 03:05:15,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-02 03:05:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 156 states and 255 transitions. [2019-12-02 03:05:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 255 transitions. [2019-12-02 03:05:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-02 03:05:18,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 136 proven. 19 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:05:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 104 states and 133 transitions. [2019-12-02 03:05:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2019-12-02 03:05:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-02 03:05:37,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-12-02 03:05:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 106 states and 135 transitions. [2019-12-02 03:05:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2019-12-02 03:05:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 03:05:41,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-02 03:05:48,046 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-02 03:05:51,416 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-02 03:05:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 109 states and 139 transitions. [2019-12-02 03:05:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2019-12-02 03:05:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 03:05:54,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-02 03:05:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:05:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 111 states and 140 transitions. [2019-12-02 03:05:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2019-12-02 03:05:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 03:05:58,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:05:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:05:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-02 03:06:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 114 states and 142 transitions. [2019-12-02 03:06:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2019-12-02 03:06:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-02 03:06:04,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 122 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:06:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 98 states and 114 transitions. [2019-12-02 03:06:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2019-12-02 03:06:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-02 03:06:24,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:06:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 101 states and 117 transitions. [2019-12-02 03:06:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2019-12-02 03:06:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-02 03:06:30,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:06:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 104 states and 120 transitions. [2019-12-02 03:06:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-12-02 03:06:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 03:06:34,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:06:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 107 states and 123 transitions. [2019-12-02 03:06:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2019-12-02 03:06:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 03:06:43,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:06:46,475 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-02 03:06:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:06:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 110 states and 126 transitions. [2019-12-02 03:06:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2019-12-02 03:06:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-02 03:06:53,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:06:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:06:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:06:56,185 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-02 03:07:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:07:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 113 states and 129 transitions. [2019-12-02 03:07:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-12-02 03:07:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 03:07:02,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:07:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:07:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:07:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:07:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 116 states and 132 transitions. [2019-12-02 03:07:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2019-12-02 03:07:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 03:07:07,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:07:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:07:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:07:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:07:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 119 states and 135 transitions. [2019-12-02 03:07:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-12-02 03:07:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 03:07:14,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:07:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:07:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-02 03:07:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:07:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 122 states and 137 transitions. [2019-12-02 03:07:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2019-12-02 03:07:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 03:07:17,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:07:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:07:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:07:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:07:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:07:18,292 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 91 iterations. [2019-12-02 03:07:18,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:07:18 ImpRootNode [2019-12-02 03:07:18,375 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 03:07:18,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 03:07:18,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 03:07:18,376 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 03:07:18,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:00:43" (3/4) ... [2019-12-02 03:07:18,377 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 03:07:18,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9b062f06-21dc-463e-bb2f-5aa23a61bea6/bin/ukojak/witness.graphml [2019-12-02 03:07:18,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 03:07:18,451 INFO L168 Benchmark]: Toolchain (without parser) took 395310.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 948.9 MB in the beginning and 671.0 MB in the end (delta: 277.9 MB). Peak memory consumption was 403.7 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,451 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:07:18,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:07:18,452 INFO L168 Benchmark]: Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,453 INFO L168 Benchmark]: RCFGBuilder took 342.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,453 INFO L168 Benchmark]: CodeCheck took 394628.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.0 GB in the beginning and 685.9 MB in the end (delta: 362.7 MB). Peak memory consumption was 389.9 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,453 INFO L168 Benchmark]: Witness Printer took 74.86 ms. Allocated memory is still 1.2 GB. Free memory was 685.9 MB in the beginning and 671.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-12-02 03:07:18,455 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 33 locations, 17 error locations. Result: UNSAFE, OverallTime: 394.5s, OverallIterations: 91, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 393216 SDtfs, 1009274362 SDslu, 0 SDs, 0 SdLazy, -348318748 SolverSat, -539782662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 165.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24132 GetRequests, 21618 SyntacticMatches, 1470 SemanticMatches, 1044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606739 ImplicationChecksByTransitivity, 386.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 46.0s InterpolantComputationTime, 3244 NumberOfCodeBlocks, 3244 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 3068 ConstructedInterpolants, 0 QuantifiedInterpolants, 549795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 90 InterpolantComputations, 18 PerfectInterpolantSequences, 8830/11483 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L8] int i = 0; VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L9] array[i] = i [L8] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L8] COND FALSE !(i < 10) [L12] return array; [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L18] COND FALSE !(i < 10) [L21] return numbers2; [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] EXPR numbers[i] VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L27] COND FALSE !(i < 10) [L31] return numbers3; [L31] return numbers3; [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L37] COND TRUE i < 10 VAL [array={6225:0}, numbers2={6226:0}, numbers4={6227:0}] [L38] numbers[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * CodeCheck took 394628.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.0 GB in the beginning and 685.9 MB in the end (delta: 362.7 MB). Peak memory consumption was 389.9 MB. Max. memory is 11.5 GB. * Witness Printer took 74.86 ms. Allocated memory is still 1.2 GB. Free memory was 685.9 MB in the beginning and 671.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...