./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/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 a69112b8d023c6203418abb04301ebe890b3a5f5 .......................................................................................................................................................................................................................................................................................................................................................................................... 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_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/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 a69112b8d023c6203418abb04301ebe890b3a5f5 ................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 18:51:37,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:51:37,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:51:37,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:51:37,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:51:37,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:51:37,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:51:37,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:51:37,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:51:37,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:51:37,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:51:37,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:51:37,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:51:37,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:51:37,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:51:37,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:51:37,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:51:37,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:51:37,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:51:37,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:51:37,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:51:37,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:51:37,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:51:37,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:51:37,584 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:51:37,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:51:37,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:51:37,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:51:37,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:51:37,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:51:37,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:51:37,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:51:37,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:51:37,596 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:51:37,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:51:37,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:51:37,597 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 18:51:37,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:51:37,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:51:37,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:51:37,612 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:51:37,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:51:37,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:51:37,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:51:37,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:51:37,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:51:37,614 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:51:37,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:51:37,614 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:51:37,614 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:51:37,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:51:37,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:51:37,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:51:37,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:51:37,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:51:37,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:51:37,618 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 18:51:37,618 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:51:37,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:51:37,618 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_b01a9fea-7f51-4f18-a489-133e3ae4283c/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 -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-18 18:51:37,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:51:37,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:51:37,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:51:37,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:51:37,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:51:37,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 18:51:37,707 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/b5b6301fe/134e60489305415c8fff29bd57583cc7/FLAG9e5237723 [2018-11-18 18:51:38,118 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:51:38,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 18:51:38,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/b5b6301fe/134e60489305415c8fff29bd57583cc7/FLAG9e5237723 [2018-11-18 18:51:38,500 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/b5b6301fe/134e60489305415c8fff29bd57583cc7 [2018-11-18 18:51:38,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:51:38,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:51:38,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:51:38,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:51:38,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:51:38,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fded83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38, skipping insertion in model container [2018-11-18 18:51:38,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:51:38,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:51:38,687 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:51:38,690 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:51:38,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:51:38,725 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:51:38,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38 WrapperNode [2018-11-18 18:51:38,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:51:38,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:51:38,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:51:38,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:51:38,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:51:38,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:51:38,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:51:38,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:51:38,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... [2018-11-18 18:51:38,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:51:38,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:51:38,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:51:38,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:51:38,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:51:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:51:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:51:39,219 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:51:39,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:39 BoogieIcfgContainer [2018-11-18 18:51:39,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:51:39,221 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:51:39,221 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:51:39,252 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:51:39,252 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:39" (1/1) ... [2018-11-18 18:51:39,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:51:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-18 18:51:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-18 18:51:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-18 18:51:39,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:39,421 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-18 18:51:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-18 18:51:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-18 18:51:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-18 18:51:39,426 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:39,670 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-18 18:51:39,671 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-18 18:51:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-18 18:51:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-18 18:51:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 18:51:39,756 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 18:51:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 18:51:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 18:51:40,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:40,380 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-18 18:51:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 18:51:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 18:51:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 18:51:40,712 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 18:51:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 18:51:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 18:51:41,228 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:41,704 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-18 18:51:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-18 18:51:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-18 18:51:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 18:51:41,935 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 18:51:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 18:51:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 18:51:42,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-18 18:51:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 18:51:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 18:51:43,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-18 18:51:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-18 18:51:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 18:51:44,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-18 18:51:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-18 18:51:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:51:44,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-18 18:51:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-18 18:51:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 18:51:45,811 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-18 18:51:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-18 18:51:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:51:46,914 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 18:51:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 18:51:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:51:47,370 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-18 18:51:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-18 18:51:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 18:51:47,755 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-18 18:51:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-18 18:51:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 18:51:48,123 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-18 18:51:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 18:51:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 18:51:48,788 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-18 18:51:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-18 18:51:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:51:49,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:51:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:51:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:51:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:51:49,647 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 18 iterations. [2018-11-18 18:51:49,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:51:49 ImpRootNode [2018-11-18 18:51:49,678 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:51:49,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:51:49,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:51:49,679 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:51:49,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:39" (3/4) ... [2018-11-18 18:51:49,684 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 18:51:49,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:51:49,685 INFO L168 Benchmark]: Toolchain (without parser) took 11180.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 958.5 MB in the beginning and 834.2 MB in the end (delta: 124.3 MB). Peak memory consumption was 332.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,689 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:51:49,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,690 INFO L168 Benchmark]: Boogie Preprocessor took 74.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,691 INFO L168 Benchmark]: RCFGBuilder took 388.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,692 INFO L168 Benchmark]: CodeCheck took 10457.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 834.2 MB in the end (delta: 305.6 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2018-11-18 18:51:49,692 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 1.2 GB. Free memory is still 834.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:51:49,697 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, 10.3s OverallTime, 18 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 655360 SDtfs, 262140 SDslu, 393208 SDs, 0 SdLazy, 655350 SolverSat, 393210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 1773 SyntacticMatches, 345 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5275 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 51096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1360 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 bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND FALSE !(i < sizeof(x) * 8) [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) [L47] CALL __VERIFIER_assert(z == zz) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 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 30.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * CodeCheck took 10457.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 834.2 MB in the end (delta: 305.6 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 ms. Allocated memory is still 1.2 GB. Free memory is still 834.2 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-5842f4b [2018-11-18 18:51:51,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:51:51,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:51:51,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:51:51,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:51:51,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:51:51,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:51:51,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:51:51,543 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:51:51,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:51:51,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:51:51,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:51:51,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:51:51,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:51:51,548 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:51:51,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:51:51,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:51:51,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:51:51,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:51:51,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:51:51,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:51:51,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:51:51,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:51:51,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:51:51,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:51:51,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:51:51,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:51:51,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:51:51,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:51:51,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:51:51,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:51:51,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:51:51,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:51:51,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:51:51,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:51:51,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:51:51,567 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-18 18:51:51,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:51:51,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:51:51,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:51:51,579 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:51:51,580 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:51:51,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:51:51,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:51:51,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:51:51,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:51:51,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:51:51,581 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:51:51,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:51:51,582 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:51:51,582 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:51:51,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:51:51,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:51:51,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:51:51,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 18:51:51,585 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 18:51:51,585 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_b01a9fea-7f51-4f18-a489-133e3ae4283c/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 -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-18 18:51:51,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:51:51,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:51:51,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:51:51,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:51:51,634 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:51:51,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 18:51:51,688 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/1cf6cb6de/3eff2b449f4649bf9650209264417029/FLAG894089a5f [2018-11-18 18:51:52,032 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:51:52,032 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 18:51:52,037 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/1cf6cb6de/3eff2b449f4649bf9650209264417029/FLAG894089a5f [2018-11-18 18:51:52,456 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/data/1cf6cb6de/3eff2b449f4649bf9650209264417029 [2018-11-18 18:51:52,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:51:52,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:51:52,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:51:52,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:51:52,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:51:52,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242f6a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52, skipping insertion in model container [2018-11-18 18:51:52,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:51:52,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:51:52,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:51:52,649 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:51:52,673 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:51:52,685 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:51:52,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52 WrapperNode [2018-11-18 18:51:52,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:51:52,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:51:52,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:51:52,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:51:52,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:51:52,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:51:52,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:51:52,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:51:52,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:51:52,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:51:52,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:51:52,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:51:52,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:51:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:51:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:51:52,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:51:52,971 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:51:52,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:52 BoogieIcfgContainer [2018-11-18 18:51:52,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:51:52,973 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:51:52,973 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:51:52,986 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:51:52,987 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:52" (1/1) ... [2018-11-18 18:51:52,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:51:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-18 18:51:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-18 18:51:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-18 18:51:53,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,078 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,109 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-18 18:51:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-18 18:51:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-18 18:51:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-18 18:51:53,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,115 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,151 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-18 18:51:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-18 18:51:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-18 18:51:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 18:51:53,195 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,196 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 18:51:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 18:51:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 18:51:53,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,306 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,367 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-18 18:51:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 18:51:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 18:51:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 18:51:53,494 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,494 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 18:51:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 18:51:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 18:51:53,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:53,780 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:53,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-18 18:51:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-18 18:51:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 18:51:54,035 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:54,036 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:54,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 18:51:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 18:51:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 18:51:54,389 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:54,390 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:54,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-18 18:51:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 18:51:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 18:51:54,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:54,572 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:54,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-18 18:51:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-18 18:51:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 18:51:54,890 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:54,891 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:54,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-18 18:51:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-18 18:51:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:51:55,158 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:55,159 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:55,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-18 18:51:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-18 18:51:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 18:51:55,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:55,439 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:55,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-18 18:51:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-18 18:51:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:51:55,749 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:55,750 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:55,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 18:51:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 18:51:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:51:56,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:56,114 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:56,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-18 18:51:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-18 18:51:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 18:51:56,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:56,472 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:56,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-18 18:51:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-18 18:51:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 18:51:56,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:56,938 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:56,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-18 18:51:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 18:51:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 18:51:57,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:57,357 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:57,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:51:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:51:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:51:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 41 states and 40 transitions. [2018-11-18 18:51:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-11-18 18:51:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:51:57,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:51:57,899 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-18 18:51:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:51:58,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:52:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:52:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:52:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 39 states and 38 transitions. [2018-11-18 18:52:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 38 transitions. [2018-11-18 18:52:09,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 18:52:09,153 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 19 iterations. [2018-11-18 18:52:09,160 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-18 18:52:09,706 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-11-18 18:52:10,263 WARN L180 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-11-18 18:52:10,264 INFO L579 CodeCheckObserver]: Invariant with dag size 217 [2018-11-18 18:52:10,290 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-18 18:52:10,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:52:10 ImpRootNode [2018-11-18 18:52:10,290 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:52:10,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:52:10,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:52:10,291 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:52:10,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:51:52" (3/4) ... [2018-11-18 18:52:10,296 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 18:52:10,304 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 18:52:10,307 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 18:52:10,307 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 18:52:10,364 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b01a9fea-7f51-4f18-a489-133e3ae4283c/bin-2019/ukojak/witness.graphml [2018-11-18 18:52:10,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:52:10,368 INFO L168 Benchmark]: Toolchain (without parser) took 17909.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 951.9 MB in the beginning and 1.2 GB in the end (delta: -260.3 MB). Peak memory consumption was 123.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,369 INFO L168 Benchmark]: CDTParser took 0.21 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-18 18:52:10,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.78 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,370 INFO L168 Benchmark]: Boogie Preprocessor took 18.52 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:52:10,370 INFO L168 Benchmark]: RCFGBuilder took 238.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 935.8 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,370 INFO L168 Benchmark]: CodeCheck took 17317.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -47.8 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,371 INFO L168 Benchmark]: Witness Printer took 76.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:52:10,373 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, 16.1s OverallTime, 19 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1310720 SDtfs, 524350 SDslu, 786552 SDs, 0 SdLazy, 1310882 SolverSat, 786464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2678 GetRequests, 2513 SyntacticMatches, 31 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8095 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 192049 SizeOfPredicates, 25 NumberOfNonLiveVariables, 777 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1632 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) && ~bvadd64(i, 4294967285bv32) == 0bv32) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32))) && ~bvadd64(i, 4294967280bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))) && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (~bvadd64(i, 4294967283bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))) && ~bvadd64(i, 4294967288bv32) == 0bv32)) || (~bvadd64(i, 4294967294bv32) == 0bv32 && z == ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))))) || (7bv32 == i && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 9bv32 == i)) || (~bvadd64(i, 4294967282bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))))) || (~bvadd64(i, 4294967291bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z)) || (~bvadd64(i, 4294967295bv32) == 0bv32 && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))))) || (~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))) == z && ~bvadd64(i, 4294967292bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 12bv32 == i)) || (~bvadd64(i, 4294967290bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))))) || (z == 0bv32 && i == 0bv32)) || (~bvadd64(i, 4294967281bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))) && ~bvadd64(i, 4294967286bv32) == 0bv32) - 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.21 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 225.78 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.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 28.57 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 935.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 18.52 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 238.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 935.8 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * CodeCheck took 17317.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -47.8 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. * Witness Printer took 76.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...