./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/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-5842f4b [2018-11-18 18:52:59,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:52:59,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:52:59,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:52:59,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:52:59,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:52:59,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:52:59,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:52:59,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:52:59,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:52:59,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:52:59,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:52:59,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:52:59,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:52:59,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:52:59,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:52:59,929 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:52:59,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:52:59,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:52:59,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:52:59,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:52:59,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:52:59,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:52:59,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:52:59,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:52:59,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:52:59,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:52:59,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:52:59,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:52:59,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:52:59,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:52:59,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:52:59,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:52:59,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:52:59,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:52:59,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:52:59,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 18:52:59,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:52:59,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:52:59,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:52:59,954 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:52:59,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:52:59,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:52:59,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:52:59,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:52:59,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:52:59,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:52:59,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:52:59,957 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:52:59,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:52:59,957 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:52:59,957 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:52:59,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:52:59,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:52:59,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:52:59,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:52:59,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:52:59,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:52:59,958 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 18:52:59,959 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:52:59,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:52:59,959 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_3923c262-7919-4b90-90a6-8cab8263ec84/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-11-18 18:52:59,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:52:59,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:52:59,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:53:00,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:53:00,001 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:53:00,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-11-18 18:53:00,047 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/data/3e52c5cf1/6cf5f9cbf48f445e965381804233237f/FLAG0e74d8640 [2018-11-18 18:53:00,393 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:53:00,393 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-11-18 18:53:00,398 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/data/3e52c5cf1/6cf5f9cbf48f445e965381804233237f/FLAG0e74d8640 [2018-11-18 18:53:00,816 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/data/3e52c5cf1/6cf5f9cbf48f445e965381804233237f [2018-11-18 18:53:00,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:53:00,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:53:00,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:53:00,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:53:00,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:53:00,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:53:00" (1/1) ... [2018-11-18 18:53:00,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3694e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:00, skipping insertion in model container [2018-11-18 18:53:00,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:53:00" (1/1) ... [2018-11-18 18:53:00,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:53:00,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:53:00,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:53:00,990 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:53:01,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:53:01,022 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:53:01,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01 WrapperNode [2018-11-18 18:53:01,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:53:01,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:53:01,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:53:01,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:53:01,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:53:01,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:53:01,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:53:01,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:53:01,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:53:01,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:53:01,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:53:01,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:53:01,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/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-11-18 18:53:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 18:53:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 18:53:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:53:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:53:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 18:53:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-18 18:53:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-18 18:53:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 18:53:01,467 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:53:01,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:01 BoogieIcfgContainer [2018-11-18 18:53:01,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:53:01,468 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:53:01,468 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:53:01,475 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:53:01,475 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:01" (1/1) ... [2018-11-18 18:53:01,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:53:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2018-11-18 18:53:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-11-18 18:53:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:53:01,515 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 18:53:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 23 states and 27 transitions. [2018-11-18 18:53:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-18 18:53:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:53:01,644 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 18:53:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 25 states and 30 transitions. [2018-11-18 18:53:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-18 18:53:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 18:53:01,753 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 18:53:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 27 states and 33 transitions. [2018-11-18 18:53:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-18 18:53:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:53:01,842 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:53:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 29 states and 36 transitions. [2018-11-18 18:53:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-18 18:53:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:53:01,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:01,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 31 states and 38 transitions. [2018-11-18 18:53:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-18 18:53:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:53:02,083 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 33 states and 40 transitions. [2018-11-18 18:53:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-18 18:53:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 18:53:02,199 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 35 states and 42 transitions. [2018-11-18 18:53:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-18 18:53:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 18:53:02,320 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 37 states and 44 transitions. [2018-11-18 18:53:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-18 18:53:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 18:53:02,443 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 39 states and 46 transitions. [2018-11-18 18:53:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 18:53:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 18:53:02,563 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 41 states and 48 transitions. [2018-11-18 18:53:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-18 18:53:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 18:53:02,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 43 states and 50 transitions. [2018-11-18 18:53:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 18:53:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 18:53:02,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:02,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 45 states and 52 transitions. [2018-11-18 18:53:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-18 18:53:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 18:53:02,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 47 states and 54 transitions. [2018-11-18 18:53:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-18 18:53:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 18:53:03,115 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2018-11-18 18:53:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 18:53:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 18:53:03,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 51 states and 58 transitions. [2018-11-18 18:53:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 18:53:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 18:53:03,385 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 53 states and 60 transitions. [2018-11-18 18:53:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-18 18:53:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 18:53:03,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 55 states and 62 transitions. [2018-11-18 18:53:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-18 18:53:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 18:53:03,671 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 57 states and 64 transitions. [2018-11-18 18:53:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 18:53:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 18:53:03,844 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:03,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 59 states and 66 transitions. [2018-11-18 18:53:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-18 18:53:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 18:53:04,052 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 61 states and 68 transitions. [2018-11-18 18:53:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-18 18:53:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 18:53:04,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 63 states and 70 transitions. [2018-11-18 18:53:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-18 18:53:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 18:53:04,345 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 65 states and 72 transitions. [2018-11-18 18:53:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-18 18:53:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 18:53:04,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:53:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 67 states and 73 transitions. [2018-11-18 18:53:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-18 18:53:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 18:53:04,647 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-18 18:53:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 69 states and 75 transitions. [2018-11-18 18:53:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-11-18 18:53:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 18:53:04,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:04,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-18 18:53:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 71 states and 77 transitions. [2018-11-18 18:53:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-18 18:53:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 18:53:04,969 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:05,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 66 proven. 12 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-11-18 18:53:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 73 states and 79 transitions. [2018-11-18 18:53:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-11-18 18:53:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 18:53:05,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:05,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 102 proven. 20 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-18 18:53:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 75 states and 81 transitions. [2018-11-18 18:53:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-18 18:53:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 18:53:05,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:05,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-18 18:53:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 77 states and 83 transitions. [2018-11-18 18:53:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-11-18 18:53:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 18:53:05,530 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:05,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 198 proven. 42 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2018-11-18 18:53:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 79 states and 85 transitions. [2018-11-18 18:53:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-18 18:53:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 18:53:05,794 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:05,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 258 proven. 56 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2018-11-18 18:53:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 81 states and 87 transitions. [2018-11-18 18:53:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-11-18 18:53:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 18:53:06,033 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:06,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 326 proven. 72 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-18 18:53:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 83 states and 89 transitions. [2018-11-18 18:53:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-18 18:53:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 18:53:06,284 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:06,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 402 proven. 90 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2018-11-18 18:53:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 85 states and 91 transitions. [2018-11-18 18:53:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-18 18:53:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 18:53:06,549 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:06,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 486 proven. 110 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2018-11-18 18:53:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 87 states and 93 transitions. [2018-11-18 18:53:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-18 18:53:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 18:53:06,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:06,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 578 proven. 132 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2018-11-18 18:53:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 89 states and 95 transitions. [2018-11-18 18:53:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-11-18 18:53:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 18:53:07,018 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:07,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 678 proven. 156 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2018-11-18 18:53:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 91 states and 97 transitions. [2018-11-18 18:53:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-11-18 18:53:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 18:53:07,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:07,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2153 backedges. 786 proven. 182 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-18 18:53:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 93 states and 99 transitions. [2018-11-18 18:53:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-18 18:53:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 18:53:07,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:07,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 902 proven. 210 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2018-11-18 18:53:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 95 states and 101 transitions. [2018-11-18 18:53:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-18 18:53:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 18:53:07,739 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:07,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2687 backedges. 1026 proven. 240 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-18 18:53:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 97 states and 103 transitions. [2018-11-18 18:53:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-11-18 18:53:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 18:53:08,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:08,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 1158 proven. 272 refuted. 0 times theorem prover too weak. 1551 trivial. 0 not checked. [2018-11-18 18:53:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 99 states and 105 transitions. [2018-11-18 18:53:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-18 18:53:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 18:53:08,317 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:08,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3293 backedges. 1298 proven. 306 refuted. 0 times theorem prover too weak. 1689 trivial. 0 not checked. [2018-11-18 18:53:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 101 states and 107 transitions. [2018-11-18 18:53:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-11-18 18:53:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 18:53:08,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:08,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 1446 proven. 342 refuted. 0 times theorem prover too weak. 1835 trivial. 0 not checked. [2018-11-18 18:53:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 103 states and 109 transitions. [2018-11-18 18:53:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-11-18 18:53:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-18 18:53:08,940 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:09,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3971 backedges. 1602 proven. 380 refuted. 0 times theorem prover too weak. 1989 trivial. 0 not checked. [2018-11-18 18:53:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 105 states and 110 transitions. [2018-11-18 18:53:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-18 18:53:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-18 18:53:09,254 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:09,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4337 backedges. 1770 proven. 2 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 107 states and 112 transitions. [2018-11-18 18:53:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-18 18:53:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 18:53:09,521 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:09,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4341 backedges. 1770 proven. 6 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 109 states and 114 transitions. [2018-11-18 18:53:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-18 18:53:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 18:53:09,902 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:10,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1770 proven. 12 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 111 states and 116 transitions. [2018-11-18 18:53:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-11-18 18:53:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 18:53:10,357 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:10,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4355 backedges. 1770 proven. 20 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 113 states and 118 transitions. [2018-11-18 18:53:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-11-18 18:53:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-18 18:53:10,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:10,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4365 backedges. 1770 proven. 30 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 115 states and 120 transitions. [2018-11-18 18:53:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-11-18 18:53:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 18:53:11,097 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:11,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4377 backedges. 1770 proven. 42 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 117 states and 122 transitions. [2018-11-18 18:53:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-11-18 18:53:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 18:53:11,615 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:11,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4391 backedges. 1770 proven. 56 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 119 states and 124 transitions. [2018-11-18 18:53:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-18 18:53:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-18 18:53:11,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:12,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4407 backedges. 1770 proven. 72 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 121 states and 126 transitions. [2018-11-18 18:53:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-18 18:53:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-18 18:53:12,274 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:12,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4425 backedges. 1770 proven. 90 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 123 states and 128 transitions. [2018-11-18 18:53:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-11-18 18:53:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 18:53:12,669 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:12,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 1770 proven. 110 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 125 states and 130 transitions. [2018-11-18 18:53:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-11-18 18:53:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-18 18:53:13,007 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:13,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 1770 proven. 132 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 127 states and 132 transitions. [2018-11-18 18:53:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-11-18 18:53:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 18:53:13,370 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:13,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4491 backedges. 1770 proven. 156 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 129 states and 134 transitions. [2018-11-18 18:53:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2018-11-18 18:53:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 18:53:13,654 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:13,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4517 backedges. 1770 proven. 182 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 131 states and 136 transitions. [2018-11-18 18:53:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2018-11-18 18:53:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-18 18:53:13,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:14,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4545 backedges. 1770 proven. 210 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 133 states and 138 transitions. [2018-11-18 18:53:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-18 18:53:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 18:53:14,312 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:14,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4575 backedges. 1770 proven. 240 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 135 states and 140 transitions. [2018-11-18 18:53:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-11-18 18:53:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-18 18:53:14,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:14,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4607 backedges. 1770 proven. 272 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 137 states and 142 transitions. [2018-11-18 18:53:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-11-18 18:53:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-18 18:53:15,035 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:15,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4641 backedges. 1770 proven. 306 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 139 states and 144 transitions. [2018-11-18 18:53:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2018-11-18 18:53:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-18 18:53:15,372 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:53:15,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:53:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4677 backedges. 1770 proven. 342 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-11-18 18:53:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:53:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 141 states and 145 transitions. [2018-11-18 18:53:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-18 18:53:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-18 18:53:15,671 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:53:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:53:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:53:28,147 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 61 iterations. [2018-11-18 18:53:28,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:53:28 ImpRootNode [2018-11-18 18:53:28,235 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:53:28,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:53:28,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:53:28,235 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:53:28,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:01" (3/4) ... [2018-11-18 18:53:28,239 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 18:53:28,340 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3923c262-7919-4b90-90a6-8cab8263ec84/bin-2019/ukojak/witness.graphml [2018-11-18 18:53:28,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:53:28,341 INFO L168 Benchmark]: Toolchain (without parser) took 27522.51 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.1 MB). Free memory was 959.2 MB in the beginning and 831.7 MB in the end (delta: 127.5 MB). Peak memory consumption was 648.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,343 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:53:28,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.86 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:53:28,344 INFO L168 Benchmark]: Boogie Preprocessor took 69.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,344 INFO L168 Benchmark]: RCFGBuilder took 342.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,344 INFO L168 Benchmark]: CodeCheck took 26766.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 835.5 MB in the end (delta: 265.2 MB). Peak memory consumption was 655.2 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,345 INFO L168 Benchmark]: Witness Printer took 105.54 ms. Allocated memory is still 1.6 GB. Free memory was 835.5 MB in the beginning and 831.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:53:28,346 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, 31 locations, 1 error locations. UNSAFE Result, 26.6s OverallTime, 61 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -4 SDslu, -8 SDs, 0 SdLazy, -524300 SolverSat, 524284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36594 GetRequests, 35262 SyntacticMatches, 1102 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21289 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 7725 NumberOfCodeBlocks, 7725 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 7437 ConstructedInterpolants, 0 QuantifiedInterpolants, 1531947 SizeOfPredicates, 59 NumberOfNonLiveVariables, 22894 ConjunctsInSsa, 670 ConjunctsInUnsatCore, 60 InterpolantComputations, 4 PerfectInterpolantSequences, 109617/117217 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] FCALL int x[20]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE, RET !(i < 20) [L32] init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) VAL [x={27: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={27:0}, x={27:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={27:0}, x={27:0}, x[i]=86] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=18, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=33, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=44, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=61, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=80, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=103, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=-2147483545, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=-2147483531, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=-2147483636, x={27:0}, x={27:0}, x[i]=0] [L17] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-2147483636, x={27:0}, x={27:0}, x[i]=0] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; [L38] EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR, FCALL x[0] [L40] temp=x[0] [L40] EXPR, FCALL x[1] [L40] FCALL x[0] = x[1] [L40] FCALL x[1] = temp [L41] CALL, EXPR rangesum(x) VAL [x={27: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={27:0}, x={27:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={27:0}, x={27:0}, x[i]=160] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=18, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=33, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=44, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=61, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=80, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=103, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=-2147483545, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=-2147483531, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=-2147483636, x={27:0}, x={27:0}, x[i]=0] [L17] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-2147483636, x={27:0}, x={27:0}, x[i]=0] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; [L41] EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR, FCALL x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<20 -1) [L46] FCALL x[20 -1] = temp [L47] CALL, EXPR rangesum(x) VAL [x={27: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={27:0}, x={27:0}] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=1, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=2, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=3, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=4, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=5, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=6, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=7, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=8, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=9, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=10, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ VAL [cnt=0, i=11, ret=0, x={27:0}, x={27:0}, x[i]=266] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=1, i=12, ret=15, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=2, i=13, ret=26, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=3, i=14, ret=43, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=4, i=15, ret=62, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=5, i=16, ret=85, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=6, i=17, ret=-2147483563, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=7, i=18, ret=-2147483549, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=8, i=19, ret=-2147483654, x={27:0}, x={27:0}, x[i]=0] [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ VAL [cnt=9, i=20, ret=-7, x={27:0}, x={27:0}, x[i]=0] [L17] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-7, x={27:0}, x={27:0}, x[i]=0] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; [L47] 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.86 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * CodeCheck took 26766.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 835.5 MB in the end (delta: 265.2 MB). Peak memory consumption was 655.2 MB. Max. memory is 11.5 GB. * Witness Printer took 105.54 ms. Allocated memory is still 1.6 GB. Free memory was 835.5 MB in the beginning and 831.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...