./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02e722fa6530375aea2bbc43a68e422ad66c6f3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:01:47,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:01:47,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:01:47,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:01:47,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:01:47,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:01:47,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:01:47,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:01:47,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:01:47,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:01:47,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:01:47,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:01:47,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:01:47,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:01:47,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:01:47,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:01:47,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:01:47,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:01:47,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:01:47,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:01:47,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:01:47,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:01:47,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:01:47,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:01:47,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:01:47,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:01:47,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:01:47,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:01:47,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:01:47,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:01:47,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:01:47,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:01:47,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:01:47,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:01:47,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:01:47,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:01:47,901 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 00:01:47,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:01:47,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:01:47,909 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:01:47,909 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 00:01:47,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:01:47,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:01:47,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:01:47,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:01:47,911 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 00:01:47,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 00:01:47,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:01:47,911 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 00:01:47,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:01:47,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:01:47,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02e722fa6530375aea2bbc43a68e422ad66c6f3 [2018-12-09 00:01:47,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:01:47,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:01:47,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:01:47,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:01:47,940 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:01:47,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-12-09 00:01:47,974 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/data/24ecbf7a6/4e2eee4a679b4d07b2e87525f6c90983/FLAG6de548ecd [2018-12-09 00:01:48,461 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:01:48,461 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-12-09 00:01:48,465 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/data/24ecbf7a6/4e2eee4a679b4d07b2e87525f6c90983/FLAG6de548ecd [2018-12-09 00:01:48,473 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/data/24ecbf7a6/4e2eee4a679b4d07b2e87525f6c90983 [2018-12-09 00:01:48,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:01:48,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:01:48,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:01:48,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:01:48,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:01:48,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48, skipping insertion in model container [2018-12-09 00:01:48,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:01:48,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:01:48,584 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:01:48,589 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:01:48,603 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:01:48,611 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:01:48,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48 WrapperNode [2018-12-09 00:01:48,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:01:48,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:01:48,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:01:48,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:01:48,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:01:48,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:01:48,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:01:48,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:01:48,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:01:48,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:01:48,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:01:48,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:01:48,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/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 [2018-12-09 00:01:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:01:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:01:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:01:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:01:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:01:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-12-09 00:01:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-12-09 00:01:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:01:48,937 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:01:48,938 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-09 00:01:48,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:48 BoogieIcfgContainer [2018-12-09 00:01:48,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:01:48,938 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 00:01:48,938 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 00:01:48,944 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 00:01:48,944 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:48" (1/1) ... [2018-12-09 00:01:48,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2018-12-09 00:01:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-09 00:01:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:01:48,976 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:01:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2018-12-09 00:01:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-12-09 00:01:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:01:49,130 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 00:01:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2018-12-09 00:01:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-09 00:01:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:01:49,194 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:01:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-12-09 00:01:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-12-09 00:01:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:01:49,263 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-12-09 00:01:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-12-09 00:01:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:01:49,341 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 22 states and 29 transitions. [2018-12-09 00:01:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-12-09 00:01:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:01:49,416 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 23 states and 30 transitions. [2018-12-09 00:01:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2018-12-09 00:01:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:01:49,484 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 24 states and 31 transitions. [2018-12-09 00:01:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2018-12-09 00:01:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:01:49,571 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 25 states and 32 transitions. [2018-12-09 00:01:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-12-09 00:01:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:01:49,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2018-12-09 00:01:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-09 00:01:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:01:49,729 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 27 states and 34 transitions. [2018-12-09 00:01:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2018-12-09 00:01:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:01:49,820 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 28 states and 35 transitions. [2018-12-09 00:01:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-09 00:01:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:01:49,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:49,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 29 states and 36 transitions. [2018-12-09 00:01:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-12-09 00:01:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:01:50,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 30 states and 37 transitions. [2018-12-09 00:01:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 00:01:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:01:50,133 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 31 states and 38 transitions. [2018-12-09 00:01:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-12-09 00:01:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:01:50,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 32 states and 39 transitions. [2018-12-09 00:01:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-09 00:01:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:01:50,353 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 33 states and 40 transitions. [2018-12-09 00:01:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-12-09 00:01:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:01:50,473 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 34 states and 41 transitions. [2018-12-09 00:01:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-09 00:01:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:01:50,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 35 states and 42 transitions. [2018-12-09 00:01:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-09 00:01:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:01:50,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 36 states and 43 transitions. [2018-12-09 00:01:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-12-09 00:01:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 00:01:50,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 37 states and 44 transitions. [2018-12-09 00:01:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-12-09 00:01:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:01:50,959 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:50,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2018-12-09 00:01:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-09 00:01:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:01:51,079 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:01:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 39 states and 45 transitions. [2018-12-09 00:01:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-12-09 00:01:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:01:51,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-12-09 00:01:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 40 states and 46 transitions. [2018-12-09 00:01:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-09 00:01:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:01:51,351 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-12-09 00:01:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 41 states and 47 transitions. [2018-12-09 00:01:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 00:01:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:01:51,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-12-09 00:01:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 42 states and 48 transitions. [2018-12-09 00:01:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-09 00:01:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:01:51,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-09 00:01:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 43 states and 49 transitions. [2018-12-09 00:01:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 00:01:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:01:51,832 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:51,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 74 proven. 15 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-12-09 00:01:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 44 states and 50 transitions. [2018-12-09 00:01:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-09 00:01:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:01:51,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-09 00:01:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 45 states and 51 transitions. [2018-12-09 00:01:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-09 00:01:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 00:01:52,138 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 130 proven. 28 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-12-09 00:01:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 46 states and 52 transitions. [2018-12-09 00:01:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-09 00:01:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:01:52,293 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 164 proven. 36 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-12-09 00:01:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 47 states and 53 transitions. [2018-12-09 00:01:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-09 00:01:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:01:52,447 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 202 proven. 45 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-12-09 00:01:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 48 states and 54 transitions. [2018-12-09 00:01:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-09 00:01:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 00:01:52,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 244 proven. 55 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-12-09 00:01:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 49 states and 55 transitions. [2018-12-09 00:01:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-12-09 00:01:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 00:01:52,816 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:52,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 290 proven. 66 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-12-09 00:01:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 50 states and 56 transitions. [2018-12-09 00:01:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-09 00:01:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 00:01:52,986 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:53,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 340 proven. 78 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-12-09 00:01:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 51 states and 57 transitions. [2018-12-09 00:01:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-12-09 00:01:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 00:01:53,166 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:53,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 394 proven. 91 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2018-12-09 00:01:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 52 states and 58 transitions. [2018-12-09 00:01:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-09 00:01:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 00:01:53,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:53,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 452 proven. 105 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-09 00:01:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 53 states and 59 transitions. [2018-12-09 00:01:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-09 00:01:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 00:01:53,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:53,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 514 proven. 120 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-12-09 00:01:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 54 states and 60 transitions. [2018-12-09 00:01:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-12-09 00:01:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:01:54,202 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:54,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 580 proven. 136 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-12-09 00:01:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 55 states and 61 transitions. [2018-12-09 00:01:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-12-09 00:01:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:01:54,413 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:54,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 650 proven. 153 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2018-12-09 00:01:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 56 states and 62 transitions. [2018-12-09 00:01:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-12-09 00:01:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 00:01:54,637 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:54,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 724 proven. 171 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2018-12-09 00:01:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 57 states and 63 transitions. [2018-12-09 00:01:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-12-09 00:01:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 00:01:54,887 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:54,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1987 backedges. 802 proven. 190 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2018-12-09 00:01:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 58 states and 63 transitions. [2018-12-09 00:01:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-12-09 00:01:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 00:01:55,103 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:55,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 886 proven. 1 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 59 states and 64 transitions. [2018-12-09 00:01:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-12-09 00:01:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 00:01:55,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:55,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 886 proven. 3 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 60 states and 65 transitions. [2018-12-09 00:01:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-09 00:01:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 00:01:55,536 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:55,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 886 proven. 6 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 61 states and 66 transitions. [2018-12-09 00:01:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-09 00:01:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 00:01:55,793 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:55,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2179 backedges. 886 proven. 10 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 62 states and 67 transitions. [2018-12-09 00:01:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-09 00:01:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 00:01:56,035 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:56,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 886 proven. 15 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 63 states and 68 transitions. [2018-12-09 00:01:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-12-09 00:01:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 00:01:56,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:56,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 886 proven. 21 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 64 states and 69 transitions. [2018-12-09 00:01:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-12-09 00:01:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 00:01:56,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:56,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 886 proven. 28 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 65 states and 70 transitions. [2018-12-09 00:01:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-12-09 00:01:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 00:01:56,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:56,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 886 proven. 36 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 66 states and 71 transitions. [2018-12-09 00:01:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-12-09 00:01:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 00:01:57,060 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:57,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 886 proven. 45 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 67 states and 72 transitions. [2018-12-09 00:01:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-12-09 00:01:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 00:01:57,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:57,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 886 proven. 55 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 68 states and 73 transitions. [2018-12-09 00:01:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-12-09 00:01:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 00:01:57,592 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:57,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 886 proven. 66 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 69 states and 74 transitions. [2018-12-09 00:01:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-12-09 00:01:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 00:01:57,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:57,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 886 proven. 78 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 70 states and 75 transitions. [2018-12-09 00:01:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-12-09 00:01:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 00:01:58,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:58,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2260 backedges. 886 proven. 91 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 71 states and 76 transitions. [2018-12-09 00:01:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-12-09 00:01:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 00:01:58,378 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:58,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 886 proven. 105 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 72 states and 77 transitions. [2018-12-09 00:01:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-12-09 00:01:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 00:01:58,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:58,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 886 proven. 120 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 73 states and 78 transitions. [2018-12-09 00:01:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-09 00:01:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 00:01:58,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:59,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 886 proven. 136 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 74 states and 79 transitions. [2018-12-09 00:01:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-09 00:01:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 00:01:59,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:59,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 886 proven. 153 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 75 states and 80 transitions. [2018-12-09 00:01:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-09 00:01:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 00:01:59,494 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:59,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 886 proven. 171 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-12-09 00:01:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 76 states and 80 transitions. [2018-12-09 00:01:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-09 00:01:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:01:59,772 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:02:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:02:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:02:12,000 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2018-12-09 00:02:12,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 12:02:12 ImpRootNode [2018-12-09 00:02:12,062 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 00:02:12,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:02:12,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:02:12,063 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:02:12,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:48" (3/4) ... [2018-12-09 00:02:12,064 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:02:12,138 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bbe8b19f-a045-4eb5-87f3-a585aa60fb43/bin-2019/ukojak/witness.graphml [2018-12-09 00:02:12,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:02:12,139 INFO L168 Benchmark]: Toolchain (without parser) took 23664.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.6 MB). Free memory was 955.9 MB in the beginning and 851.4 MB in the end (delta: 104.5 MB). Peak memory consumption was 560.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,140 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:02:12,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.00 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,140 INFO L168 Benchmark]: Boogie Preprocessor took 17.25 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,140 INFO L168 Benchmark]: RCFGBuilder took 255.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,141 INFO L168 Benchmark]: CodeCheck took 23123.93 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 344.5 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 211.2 MB). Peak memory consumption was 555.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,141 INFO L168 Benchmark]: Witness Printer took 76.15 ms. Allocated memory is still 1.5 GB. Free memory was 864.9 MB in the beginning and 851.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:02:12,142 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 28 locations, 1 error locations. UNSAFE Result, 23.0s OverallTime, 60 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, -8912906 SolverSat, 524282 SolverUnsat, 8388608 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20581 GetRequests, 19800 SyntacticMatches, 551 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21289 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 4150 NumberOfCodeBlocks, 4150 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3972 ConstructedInterpolants, 0 QuantifiedInterpolants, 422886 SizeOfPredicates, 59 NumberOfNonLiveVariables, 19581 ConjunctsInSsa, 669 ConjunctsInUnsatCore, 59 InterpolantComputations, 3 PerfectInterpolantSequences, 54891/58691 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[20]; [L5] int i; [L6] i = 0 [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 20) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) VAL [x={21:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={21:0}, x={21:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={21:0}, x={21:0}, x[i]=83] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=10, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=17, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=-6, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=0, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=7, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=15, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=24, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=27, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=36, x={21:0}, x={21:0}, x[i]=0] [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) VAL [x={21:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={21:0}, x={21:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={21:0}, x={21:0}, x[i]=145] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=10, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=17, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=-6, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=0, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=7, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=15, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=24, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=27, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=36, x={21:0}, x={21:0}, x[i]=0] [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<20 -1) [L46] x[20 -1] = temp [L47] CALL, EXPR rangesum(x) VAL [x={21:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={21:0}, x={21:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={21:0}, x={21:0}, x[i]=247] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=7, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=-16, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=-10, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=-3, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=5, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=14, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=17, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=26, x={21:0}, x={21:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=19, x={21:0}, x={21:0}, x[i]=0] [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.00 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.25 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 255.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * CodeCheck took 23123.93 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 344.5 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 211.2 MB). Peak memory consumption was 555.7 MB. Max. memory is 11.5 GB. * Witness Printer took 76.15 ms. Allocated memory is still 1.5 GB. Free memory was 864.9 MB in the beginning and 851.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...