./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/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 842b1d955d5d034fb473369e35dc57ba15dfee95 ..................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/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 842b1d955d5d034fb473369e35dc57ba15dfee95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 10:17:32,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:17:32,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:17:32,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:17:32,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:17:32,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:17:32,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:17:32,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:17:32,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:17:32,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:17:32,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:17:32,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:17:32,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:17:32,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:17:32,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:17:32,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:17:32,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:17:32,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:17:32,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:17:32,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:17:32,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:17:32,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:17:32,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:17:32,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:17:32,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:17:32,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:17:32,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:17:32,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:17:32,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:17:32,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:17:32,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:17:32,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:17:32,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:17:32,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:17:32,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:17:32,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:17:32,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 10:17:32,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:17:32,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:17:32,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:17:32,045 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:17:32,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:17:32,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:17:32,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:17:32,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:17:32,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:17:32,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:17:32,047 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 10:17:32,047 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 10:17:32,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:17:32,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:17:32,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:17:32,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:17:32,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:17:32,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:17:32,049 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 10:17:32,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:17:32,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:17:32,049 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_5141eeea-1e81-4200-bd68-f188d5455773/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 -> 842b1d955d5d034fb473369e35dc57ba15dfee95 [2018-11-10 10:17:32,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:17:32,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:17:32,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:17:32,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:17:32,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:17:32,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-11-10 10:17:32,130 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/f1ee89f0b/f516dd8fc9674a6ebb8d82679b8c498e/FLAG61bf46681 [2018-11-10 10:17:32,517 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:17:32,518 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-11-10 10:17:32,528 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/f1ee89f0b/f516dd8fc9674a6ebb8d82679b8c498e/FLAG61bf46681 [2018-11-10 10:17:32,539 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/f1ee89f0b/f516dd8fc9674a6ebb8d82679b8c498e [2018-11-10 10:17:32,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:17:32,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:17:32,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:17:32,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:17:32,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:17:32,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:32,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49481402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32, skipping insertion in model container [2018-11-10 10:17:32,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:32,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:17:32,588 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:17:32,805 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:17:32,808 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:17:32,875 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:17:32,887 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:17:32,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32 WrapperNode [2018-11-10 10:17:32,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:17:32,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:17:32,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:17:32,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:17:32,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:32,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:17:33,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:17:33,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:17:33,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:17:33,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... [2018-11-10 10:17:33,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:17:33,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:17:33,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:17:33,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:17:33,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/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-10 10:17:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 10:17:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:17:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:19:52,209 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:19:52,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:52 BoogieIcfgContainer [2018-11-10 10:19:52,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:19:52,210 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 10:19:52,210 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 10:19:52,218 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 10:19:52,218 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:19:52" (1/1) ... [2018-11-10 10:19:52,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:19:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 10 states and 13 transitions. [2018-11-10 10:19:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-11-10 10:19:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-10 10:19:52,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-10 10:19:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-10 10:19:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:19:52,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 23 states and 32 transitions. [2018-11-10 10:19:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2018-11-10 10:19:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:19:52,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 32 states and 51 transitions. [2018-11-10 10:19:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2018-11-10 10:19:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:19:54,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 36 states and 56 transitions. [2018-11-10 10:19:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2018-11-10 10:19:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:19:54,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:19:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:20:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 10:20:07,933 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: Solver said unknown at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:508) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 10:20:07,936 INFO L168 Benchmark]: Toolchain (without parser) took 155394.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.0 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -368.0 MB). Peak memory consumption was 84.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,937 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:20:07,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.79 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -211.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,938 INFO L168 Benchmark]: Boogie Preprocessor took 47.62 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,939 INFO L168 Benchmark]: RCFGBuilder took 139156.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.4 MB). Peak memory consumption was 495.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,939 INFO L168 Benchmark]: CodeCheck took 15725.28 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 148.4 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -105.3 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:07,942 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: Solver said unknown de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: Solver said unknown: de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:508) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.79 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -211.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.62 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 139156.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.4 MB). Peak memory consumption was 495.9 MB. Max. memory is 11.5 GB. * CodeCheck took 15725.28 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 148.4 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -105.3 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:20:09,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:20:09,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:20:09,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:20:09,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:20:09,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:20:09,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:20:09,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:20:09,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:20:09,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:20:09,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:20:09,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:20:09,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:20:09,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:20:09,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:20:09,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:20:09,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:20:09,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:20:09,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:20:09,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:20:09,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:20:09,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:20:09,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:20:09,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:20:09,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:20:09,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:20:09,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:20:09,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:20:09,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:20:09,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:20:09,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:20:09,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:20:09,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:20:09,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:20:09,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:20:09,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:20:09,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-10 10:20:09,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:20:09,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:20:09,414 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:20:09,414 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:20:09,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:20:09,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:20:09,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:20:09,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:20:09,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:20:09,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:20:09,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:20:09,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:20:09,416 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:20:09,416 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:20:09,417 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:20:09,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:20:09,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:20:09,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:20:09,417 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 10:20:09,417 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 10:20:09,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:20:09,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-10 10:20:09,418 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:20:09,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:20:09,419 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:20:09,419 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:20:09,419 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_5141eeea-1e81-4200-bd68-f188d5455773/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 -> 842b1d955d5d034fb473369e35dc57ba15dfee95 [2018-11-10 10:20:09,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:20:09,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:20:09,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:20:09,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:20:09,465 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:20:09,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-11-10 10:20:09,511 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/3a7bf7a00/ddb08a25f8704574942f8c503c721089/FLAG6785d2e8c [2018-11-10 10:20:09,949 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:20:09,950 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-11-10 10:20:09,960 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/3a7bf7a00/ddb08a25f8704574942f8c503c721089/FLAG6785d2e8c [2018-11-10 10:20:09,971 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/data/3a7bf7a00/ddb08a25f8704574942f8c503c721089 [2018-11-10 10:20:09,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:20:09,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:20:09,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:20:09,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:20:09,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:20:09,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:09" (1/1) ... [2018-11-10 10:20:09,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3636703d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:09, skipping insertion in model container [2018-11-10 10:20:09,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:09" (1/1) ... [2018-11-10 10:20:09,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:20:10,024 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:20:10,295 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:20:10,299 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:20:10,393 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:20:10,406 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:20:10,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10 WrapperNode [2018-11-10 10:20:10,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:20:10,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:20:10,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:20:10,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:20:10,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:20:10,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:20:10,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:20:10,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:20:10,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... [2018-11-10 10:20:10,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:20:10,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:20:10,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:20:10,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:20:10,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/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-10 10:20:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 10:20:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:20:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:22:03,033 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:22:03,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:22:03 BoogieIcfgContainer [2018-11-10 10:22:03,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:22:03,034 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 10:22:03,034 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 10:22:03,041 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 10:22:03,042 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:22:03" (1/1) ... [2018-11-10 10:22:03,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:22:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:22:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 10 states and 13 transitions. [2018-11-10 10:22:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-11-10 10:22:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-10 10:22:03,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:22:03,108 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 10:22:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:22:03,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:22:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:22:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:22:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-10 10:22:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-10 10:22:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:22:04,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:22:04,030 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 10:22:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:22:04,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:22:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:22:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:22:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2018-11-10 10:22:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-11-10 10:22:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:22:09,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:22:09,438 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 10:22:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:22:11,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:22:11,666 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-11-10 10:22:12,183 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 109 [2018-11-10 10:22:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:22:19,896 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 10:22:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:22:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 32 states and 48 transitions. [2018-11-10 10:22:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2018-11-10 10:22:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 10:22:22,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:22:22,582 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 10:22:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:22:23,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:22:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:22:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:22:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 40 states and 60 transitions. [2018-11-10 10:22:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2018-11-10 10:22:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:22:28,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:22:28,725 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 10:22:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:22:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:22:40,797 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 5 iterations. [2018-11-10 10:22:40,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 10:22:40 ImpRootNode [2018-11-10 10:22:40,841 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 10:22:40,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:22:40,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:22:40,842 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:22:40,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:22:03" (3/4) ... [2018-11-10 10:22:40,844 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:22:40,928 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5141eeea-1e81-4200-bd68-f188d5455773/bin-2019/ukojak/witness.graphml [2018-11-10 10:22:40,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:22:40,928 INFO L168 Benchmark]: Toolchain (without parser) took 150954.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 941.2 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 176.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,929 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:22:40,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.47 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 903.6 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 903.6 MB in the beginning and 1.1 GB in the end (delta: -230.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,930 INFO L168 Benchmark]: Boogie Preprocessor took 44.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,930 INFO L168 Benchmark]: RCFGBuilder took 112474.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 851.5 MB in the end (delta: 275.3 MB). Peak memory consumption was 414.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,930 INFO L168 Benchmark]: CodeCheck took 37807.12 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 851.5 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:22:40,930 INFO L168 Benchmark]: Witness Printer took 86.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:22:40,933 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 1 procedures, 207 locations, 1 error locations. UNSAFE Result, 37.7s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 256 SDslu, 256 SDs, 0 SdLazy, 476 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 424 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 45785 SizeOfPredicates, 26 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/30 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: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] __VERIFIER_error() VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 430.47 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 903.6 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 903.6 MB in the beginning and 1.1 GB in the end (delta: -230.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 112474.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 851.5 MB in the end (delta: 275.3 MB). Peak memory consumption was 414.2 MB. Max. memory is 11.5 GB. * CodeCheck took 37807.12 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 851.5 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 86.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forcibly destroying the process Received shutdown request...