./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/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 d2a071cc6090a217f48ed180b566a651717a8e39 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/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 d2a071cc6090a217f48ed180b566a651717a8e39 .................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:15:52,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:15:52,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:15:53,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:15:53,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:15:53,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:15:53,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:15:53,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:15:53,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:15:53,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:15:53,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:15:53,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:15:53,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:15:53,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:15:53,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:15:53,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:15:53,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:15:53,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:15:53,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:15:53,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:15:53,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:15:53,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:15:53,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:15:53,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:15:53,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:15:53,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:15:53,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:15:53,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:15:53,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:15:53,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:15:53,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:15:53,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:15:53,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:15:53,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:15:53,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:15:53,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:15:53,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 00:15:53,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:15:53,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:15:53,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:15:53,027 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 00:15:53,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:15:53,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:15:53,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:15:53,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:15:53,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:15:53,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:15:53,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:15:53,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:15:53,030 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 00:15:53,030 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 00:15:53,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:15:53,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:15:53,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 00:15:53,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:15:53,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:15:53,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:15:53,031 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 00:15:53,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:15:53,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:15:53,031 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_40888292-ba87-4c67-8111-36c020e1e8e6/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 00:15:53,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:15:53,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:15:53,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:15:53,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:15:53,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:15:53,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 00:15:53,106 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/ec0bcc970/e812386086824f8595a586f9e540d1d9/FLAG12dbfcbe5 [2018-11-23 00:15:53,406 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:15:53,407 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 00:15:53,411 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/ec0bcc970/e812386086824f8595a586f9e540d1d9/FLAG12dbfcbe5 [2018-11-23 00:15:53,423 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/ec0bcc970/e812386086824f8595a586f9e540d1d9 [2018-11-23 00:15:53,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:15:53,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:15:53,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:53,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:15:53,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:15:53,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3a967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53, skipping insertion in model container [2018-11-23 00:15:53,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:15:53,453 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:15:53,564 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:53,567 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:15:53,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:53,585 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:15:53,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53 WrapperNode [2018-11-23 00:15:53,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:53,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:53,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:15:53,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:15:53,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:53,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:15:53,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:15:53,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:15:53,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:15:53,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:15:53,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:15:53,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:15:53,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/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-23 00:15:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:15:53,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:15:53,834 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:15:53,834 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 00:15:53,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:53 BoogieIcfgContainer [2018-11-23 00:15:53,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:15:53,835 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 00:15:53,835 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 00:15:53,841 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 00:15:53,841 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:53" (1/1) ... [2018-11-23 00:15:53,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 00:15:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 00:15:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 00:15:53,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:53,989 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-23 00:15:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-23 00:15:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-23 00:15:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 00:15:54,019 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-11-23 00:15:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-11-23 00:15:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 00:15:54,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 00:15:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 00:15:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:15:54,307 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 00:15:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 00:15:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:15:54,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 00:15:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 00:15:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:15:54,568 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 00:15:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 00:15:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:15:54,713 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 00:15:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 00:15:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:15:54,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 15 states and 14 transitions. [2018-11-23 00:15:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 00:15:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 00:15:55,064 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:55,168 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0, main_~bit~0, main_~x~0, main_~y~0, main_~c~0;havoc main_~x~0;havoc main_~y~0;havoc main_~c~0;main_~x~0 := 37;main_~y~0 := 0;main_~c~0 := 0; VAL [ULTIMATE.start_main_~c~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=2, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=3, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=4, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=5, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=6, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=7, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~c~0 % 256 < 8);main_~i~0 := ~shiftLeft(1, main_~c~0 % 256);main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256);BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~bit~0 % 256;main_~y~0 := main_~y~0 % 256 + main_~i~0 % 256;ParallelCodeBlock1: assume !(0 != main_~bit~0 % 256);}EndParallelCompositionmain_~c~0 := 1 + main_~c~0 % 256; VAL [ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=8, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~c~0 % 256 < 8);}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_~x~0 % 256 == main_~y~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=8, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=8, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~bit~0=0, ULTIMATE.start_main_~c~0=8, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~x~0=37, ULTIMATE.start_main_~y~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_~i~0, main_~bit~0, main_~x~0, main_~y~0, main_~c~0; [L14] havoc main_~x~0; [L15] havoc main_~y~0; [L16] havoc main_~c~0; [L18] main_~x~0 := 37; [L19] main_~y~0 := 0; [L20] main_~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !(main_~c~0 % 256 < 8); [L29] __VERIFIER_assert_#in~cond := (if main_~x~0 % 256 == main_~y~0 % 256 then 1 else 0); [L29] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0, main_~bit~0, main_~x~0, main_~y~0, main_~c~0; [L14] havoc main_~x~0; [L15] havoc main_~y~0; [L16] havoc main_~c~0; [L18] main_~x~0 := 37; [L19] main_~y~0 := 0; [L20] main_~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !!(main_~c~0 % 256 < 8); [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24-L26] assume !(0 != main_~bit~0 % 256); [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] assume !(main_~c~0 % 256 < 8); [L29] __VERIFIER_assert_#in~cond := (if main_~x~0 % 256 == main_~y~0 % 256 then 1 else 0); [L29] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] havoc main_#res; [?] havoc main_~i~0, main_~bit~0, main_~x~0, main_~y~0, main_~c~0; [L14] havoc main_~x~0; [L15] havoc main_~y~0; [L16] havoc main_~c~0; [L18] main_~x~0 := 37; [L19] main_~y~0 := 0; [L20] main_~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND TRUE !(main_~c~0 % 256 < 8) [L29] __VERIFIER_assert_#in~cond := (if main_~x~0 % 256 == main_~y~0 % 256 then 1 else 0); [L29] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0, main_~bit~0, main_~x~0, main_~y~0, main_~c~0; [L14] havoc main_~x~0; [L15] havoc main_~y~0; [L16] havoc main_~c~0; [L18] main_~x~0 := 37; [L19] main_~y~0 := 0; [L20] main_~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND FALSE !(!(main_~c~0 % 256 < 8)) [L22] main_~i~0 := ~shiftLeft(1, main_~c~0 % 256); [L23] main_~bit~0 := ~bitwiseAnd(main_~x~0 % 256, main_~i~0 % 256); [L24] COND FALSE !(0 != main_~bit~0 % 256) [L27] main_~c~0 := 1 + main_~c~0 % 256; VAL [main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L21-L28] COND TRUE !(main_~c~0 % 256 < 8) [L29] __VERIFIER_assert_#in~cond := (if main_~x~0 % 256 == main_~y~0 % 256 then 1 else 0); [L29] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~0=0, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND TRUE !(~c~0 % 256 < 8) [L4-L9] ~cond := #in~cond; [L5] COND TRUE 0 == ~cond [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); [L24] COND FALSE !(0 != ~bit~0 % 256) [L27] ~c~0 := 1 + ~c~0 % 256; [L21-L28] COND TRUE !(~c~0 % 256 < 8) [L4-L9] ~cond := #in~cond; [L5] COND TRUE 0 == ~cond [L6] assert false; [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND FALSE !(c < (unsigned char)8) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() ----- [2018-11-23 00:15:55,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:15:55 ImpRootNode [2018-11-23 00:15:55,221 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 00:15:55,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:15:55,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:15:55,222 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:15:55,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:53" (3/4) ... [2018-11-23 00:15:55,238 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:15:55,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:15:55,239 INFO L168 Benchmark]: Toolchain (without parser) took 1812.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.9 MB in the beginning and 942.3 MB in the end (delta: 19.6 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,240 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:15:55,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,242 INFO L168 Benchmark]: Boogie Preprocessor took 47.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,243 INFO L168 Benchmark]: RCFGBuilder took 178.60 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,244 INFO L168 Benchmark]: CodeCheck took 1386.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 172.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:55,244 INFO L168 Benchmark]: Witness Printer took 16.34 ms. Allocated memory is still 1.2 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:15:55,254 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, 12 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 1846 SolverSat, 1722 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 327 SyntacticMatches, 42 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 3919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 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 - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND FALSE !(bit != (unsigned char)0) [L27] c = c + ((unsigned char)1) [L21] COND FALSE !(c < (unsigned char)8) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() * 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.60 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * CodeCheck took 1386.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 172.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. * Witness Printer took 16.34 ms. Allocated memory is still 1.2 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 00:15:56,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:15:56,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:15:56,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:15:56,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:15:56,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:15:56,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:15:56,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:15:56,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:15:56,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:15:56,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:15:56,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:15:56,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:15:56,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:15:56,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:15:56,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:15:56,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:15:56,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:15:56,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:15:56,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:15:56,655 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:15:56,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:15:56,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:15:56,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:15:56,657 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:15:56,658 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:15:56,659 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:15:56,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:15:56,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:15:56,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:15:56,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:15:56,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:15:56,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:15:56,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:15:56,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:15:56,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:15:56,663 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 00:15:56,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:15:56,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:15:56,674 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:15:56,675 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 00:15:56,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:15:56,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:15:56,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:15:56,676 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:15:56,676 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:15:56,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:15:56,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:15:56,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:15:56,678 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 00:15:56,678 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 00:15:56,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:15:56,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:15:56,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 00:15:56,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:15:56,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:15:56,679 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:15:56,679 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_40888292-ba87-4c67-8111-36c020e1e8e6/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 00:15:56,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:15:56,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:15:56,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:15:56,723 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:15:56,723 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:15:56,723 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 00:15:56,767 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/8355ef29f/a3a0d1dc21eb44848beb4459f7973f94/FLAG67510dfad [2018-11-23 00:15:57,158 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:15:57,158 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 00:15:57,162 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/8355ef29f/a3a0d1dc21eb44848beb4459f7973f94/FLAG67510dfad [2018-11-23 00:15:57,169 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/data/8355ef29f/a3a0d1dc21eb44848beb4459f7973f94 [2018-11-23 00:15:57,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:15:57,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:15:57,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:57,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:15:57,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:15:57,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64774838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57, skipping insertion in model container [2018-11-23 00:15:57,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:15:57,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:15:57,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:57,318 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:15:57,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:57,339 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:15:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57 WrapperNode [2018-11-23 00:15:57,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:57,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:57,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:15:57,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:15:57,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:57,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:15:57,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:15:57,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:15:57,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:15:57,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:15:57,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:15:57,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:15:57,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/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-23 00:15:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:15:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:15:57,590 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:15:57,590 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 00:15:57,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:57 BoogieIcfgContainer [2018-11-23 00:15:57,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:15:57,591 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 00:15:57,591 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 00:15:57,597 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 00:15:57,597 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:57" (1/1) ... [2018-11-23 00:15:57,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 00:15:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 00:15:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 00:15:57,626 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:57,661 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:57,711 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-23 00:15:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-23 00:15:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-23 00:15:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 00:15:57,741 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:57,742 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-23 00:15:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-23 00:15:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 00:15:57,814 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:57,815 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 00:15:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 00:15:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:15:57,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:57,886 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 00:15:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 00:15:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:15:57,980 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:57,981 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 00:15:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 00:15:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:15:58,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:58,091 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 00:15:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 00:15:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:15:58,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:58,183 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 00:15:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 00:15:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:15:58,283 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:58,284 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 15 states and 14 transitions. [2018-11-23 00:15:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 00:15:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 00:15:58,406 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:15:58,406 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:15:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:15:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 13 states and 12 transitions. [2018-11-23 00:15:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2018-11-23 00:15:59,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:15:59,379 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 10 iterations. [2018-11-23 00:15:59,385 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 00:15:59,419 INFO L579 CodeCheckObserver]: Invariant with dag size 37 [2018-11-23 00:15:59,429 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 00:15:59,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:15:59 ImpRootNode [2018-11-23 00:15:59,429 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 00:15:59,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:15:59,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:15:59,430 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:15:59,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:57" (3/4) ... [2018-11-23 00:15:59,433 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:15:59,439 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 00:15:59,439 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 00:15:59,439 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:15:59,462 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40888292-ba87-4c67-8111-36c020e1e8e6/bin-2019/ukojak/witness.graphml [2018-11-23 00:15:59,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:15:59,463 INFO L168 Benchmark]: Toolchain (without parser) took 2291.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:59,464 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-23 00:15:59,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:59,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.18 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:59,465 INFO L168 Benchmark]: Boogie Preprocessor took 13.33 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:15:59,465 INFO L168 Benchmark]: RCFGBuilder took 219.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -210.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:59,465 INFO L168 Benchmark]: CodeCheck took 1838.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:15:59,466 INFO L168 Benchmark]: Witness Printer took 33.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:15:59,467 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, 12 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 10 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 768 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 3134 SolverSat, 3098 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 1966 SizeOfPredicates, 29 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/120 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 - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((37bv8 == x && 37bv8 == y) && 8bv8 == c) || ((7bv8 == c && 37bv8 == x) && 37bv8 == y)) || ((2bv8 == c && 1bv8 == y) && 37bv8 == x)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || ((1bv8 == y && 37bv8 == x) && 1bv8 == c)) || ((4bv8 == c && 37bv8 == x) && 5bv8 == y)) || ((37bv8 == x && 3bv8 == c) && 5bv8 == y)) || ((37bv8 == x && 37bv8 == y) && 6bv8 == c)) || ((37bv8 == x && 5bv8 == c) && 5bv8 == y) - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 * 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 166.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.18 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.33 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 219.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -210.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * CodeCheck took 1838.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * Witness Printer took 33.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...