./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/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_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/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_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/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_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/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-aa41828 [2018-11-23 05:53:13,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:53:13,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:53:13,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:53:13,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:53:13,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:53:13,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:53:13,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:53:13,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:53:13,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:53:13,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:53:13,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:53:13,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:53:13,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:53:13,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:53:13,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:53:13,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:53:13,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:53:13,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:53:13,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:53:13,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:53:13,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:53:13,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:53:13,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:53:13,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:53:13,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:53:13,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:53:13,894 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:53:13,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:53:13,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:53:13,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:53:13,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:53:13,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:53:13,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:53:13,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:53:13,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:53:13,898 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 05:53:13,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:53:13,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:53:13,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:53:13,907 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 05:53:13,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:53:13,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:53:13,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:53:13,908 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:53:13,908 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:53:13,908 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:53:13,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:53:13,909 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:53:13,909 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:53:13,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:53:13,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:53:13,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:53:13,910 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_a76364da-5e15-4dc9-867b-11b0e6b68130/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-23 05:53:13,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:53:13,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:53:13,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:53:13,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:53:13,943 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:53:13,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-23 05:53:13,979 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/0841c45d4/4d40d63941fa4579aaf3176f93b322d6/FLAGfa3992460 [2018-11-23 05:53:14,412 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:53:14,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-23 05:53:14,417 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/0841c45d4/4d40d63941fa4579aaf3176f93b322d6/FLAGfa3992460 [2018-11-23 05:53:14,426 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/0841c45d4/4d40d63941fa4579aaf3176f93b322d6 [2018-11-23 05:53:14,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:53:14,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:53:14,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:53:14,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:53:14,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:53:14,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d4648b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14, skipping insertion in model container [2018-11-23 05:53:14,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:53:14,454 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:53:14,566 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:53:14,568 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:53:14,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:53:14,593 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:53:14,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14 WrapperNode [2018-11-23 05:53:14,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:53:14,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:53:14,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:53:14,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:53:14,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:53:14,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:53:14,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:53:14,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:53:14,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:53:14,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:53:14,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:53:14,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:53:14,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:53:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:53:14,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:53:14,814 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:53:14,814 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 05:53:14,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:14 BoogieIcfgContainer [2018-11-23 05:53:14,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:53:14,815 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:53:14,815 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:53:14,824 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:53:14,824 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:14" (1/1) ... [2018-11-23 05:53:14,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:53:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 05:53:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 05:53:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:53:14,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-23 05:53:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-23 05:53:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 05:53:15,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-23 05:53:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-23 05:53:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 05:53:15,100 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 05:53:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 05:53:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 05:53:15,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 05:53:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 05:53:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 05:53:15,359 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 05:53:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 05:53:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:53:15,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 05:53:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 05:53:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:53:15,613 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 05:53:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 05:53:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:53:15,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 05:53:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 05:53:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:53:15,966 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 05:53:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 05:53:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:53:16,153 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 05:53:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 05:53:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:53:16,342 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 05:53:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 05:53:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:53:16,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 05:53:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 05:53:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:53:16,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 05:53:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 05:53:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:53:16,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 05:53:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 05:53:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:53:17,207 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 05:53:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 05:53:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:53:17,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 05:53:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 05:53:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:53:17,735 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:53:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:53:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:53:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:53:17,803 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~xx~0, main_~yy~0, main_~zz~0, main_~z~0, main_~i~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~xx~0;havoc main_~yy~0;havoc main_~zz~0;main_~z~0 := 0;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~z~0=0] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=1] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=2] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=3] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=4] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=5] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=6] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=7] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=8] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=9] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=10] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=11] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=12] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=13] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=14] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=15] [?] assume !!(main_~i~0 % 4294967296 < 16);main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0)));main_~i~0 := 1 + main_~i~0; VAL [ULTIMATE.start_main_~i~0=16] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 % 4294967296 < 16);}EndParallelCompositionmain_~xx~0 := main_~x~0 % 65536;main_~yy~0 := main_~y~0 % 65536;main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 256 * main_~xx~0), 16711935);main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 16 * main_~xx~0), 252645135);main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 4 * main_~xx~0), 858993459);main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 2 * main_~xx~0), 1431655765);main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 256 * main_~yy~0), 16711935);main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 16 * main_~yy~0), 252645135);main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 4 * main_~yy~0), 858993459);main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 2 * main_~yy~0), 1431655765);main_~zz~0 := ~bitwiseOr(main_~xx~0, 2 * main_~yy~0);__VERIFIER_assert_#in~cond := (if main_~z~0 % 4294967296 == main_~zz~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=16, ULTIMATE.start_main_~zz~0=1, ULTIMATE.start_main_~z~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=16, ULTIMATE.start_main_~zz~0=1, ULTIMATE.start_main_~z~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=16, ULTIMATE.start_main_~zz~0=1, ULTIMATE.start_main_~z~0=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~xx~0, main_~yy~0, main_~zz~0, main_~z~0, main_~i~0; [L23] main_~x~0 := main_#t~nondet0; [L23] havoc main_#t~nondet0; [L24] main_~y~0 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~0; [L26] havoc main_~yy~0; [L27] havoc main_~zz~0; [L28] main_~z~0 := 0; [L29] main_~i~0 := 0; VAL [main_~i~0=0, main_~z~0=0] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=1] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=2] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=3] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=4] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=5] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=6] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=7] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=8] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=9] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=10] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=11] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=12] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=13] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=14] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=15] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=16] [L30-L33] assume !(main_~i~0 % 4294967296 < 16); [L34] main_~xx~0 := main_~x~0 % 65536; [L35] main_~yy~0 := main_~y~0 % 65536; [L36] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 256 * main_~xx~0), 16711935); [L37] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 16 * main_~xx~0), 252645135); [L38] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 4 * main_~xx~0), 858993459); [L39] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 2 * main_~xx~0), 1431655765); [L40] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 256 * main_~yy~0), 16711935); [L41] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 16 * main_~yy~0), 252645135); [L42] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 4 * main_~yy~0), 858993459); [L43] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 2 * main_~yy~0), 1431655765); [L45] main_~zz~0 := ~bitwiseOr(main_~xx~0, 2 * main_~yy~0); [L47] __VERIFIER_assert_#in~cond := (if main_~z~0 % 4294967296 == main_~zz~0 % 4294967296 then 1 else 0); [L47] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~xx~0, main_~yy~0, main_~zz~0, main_~z~0, main_~i~0; [L23] main_~x~0 := main_#t~nondet0; [L23] havoc main_#t~nondet0; [L24] main_~y~0 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~0; [L26] havoc main_~yy~0; [L27] havoc main_~zz~0; [L28] main_~z~0 := 0; [L29] main_~i~0 := 0; VAL [main_~i~0=0, main_~z~0=0] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=1] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=2] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=3] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=4] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=5] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=6] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=7] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=8] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=9] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=10] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=11] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=12] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=13] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=14] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=15] [L30-L33] assume !!(main_~i~0 % 4294967296 < 16); [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=16] [L30-L33] assume !(main_~i~0 % 4294967296 < 16); [L34] main_~xx~0 := main_~x~0 % 65536; [L35] main_~yy~0 := main_~y~0 % 65536; [L36] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 256 * main_~xx~0), 16711935); [L37] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 16 * main_~xx~0), 252645135); [L38] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 4 * main_~xx~0), 858993459); [L39] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 2 * main_~xx~0), 1431655765); [L40] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 256 * main_~yy~0), 16711935); [L41] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 16 * main_~yy~0), 252645135); [L42] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 4 * main_~yy~0), 858993459); [L43] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 2 * main_~yy~0), 1431655765); [L45] main_~zz~0 := ~bitwiseOr(main_~xx~0, 2 * main_~yy~0); [L47] __VERIFIER_assert_#in~cond := (if main_~z~0 % 4294967296 == main_~zz~0 % 4294967296 then 1 else 0); [L47] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~xx~0, main_~yy~0, main_~zz~0, main_~z~0, main_~i~0; [L23] main_~x~0 := main_#t~nondet0; [L23] havoc main_#t~nondet0; [L24] main_~y~0 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~0; [L26] havoc main_~yy~0; [L27] havoc main_~zz~0; [L28] main_~z~0 := 0; [L29] main_~i~0 := 0; VAL [main_~i~0=0, main_~z~0=0] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=1] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=2] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=3] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=4] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=5] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=6] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=7] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=8] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=9] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=10] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=11] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=12] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=13] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=14] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=15] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=16] [L30-L33] COND TRUE !(main_~i~0 % 4294967296 < 16) [L34] main_~xx~0 := main_~x~0 % 65536; [L35] main_~yy~0 := main_~y~0 % 65536; [L36] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 256 * main_~xx~0), 16711935); [L37] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 16 * main_~xx~0), 252645135); [L38] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 4 * main_~xx~0), 858993459); [L39] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 2 * main_~xx~0), 1431655765); [L40] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 256 * main_~yy~0), 16711935); [L41] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 16 * main_~yy~0), 252645135); [L42] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 4 * main_~yy~0), 858993459); [L43] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 2 * main_~yy~0), 1431655765); [L45] main_~zz~0 := ~bitwiseOr(main_~xx~0, 2 * main_~yy~0); [L47] __VERIFIER_assert_#in~cond := (if main_~z~0 % 4294967296 == main_~zz~0 % 4294967296 then 1 else 0); [L47] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~xx~0, main_~yy~0, main_~zz~0, main_~z~0, main_~i~0; [L23] main_~x~0 := main_#t~nondet0; [L23] havoc main_#t~nondet0; [L24] main_~y~0 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~0; [L26] havoc main_~yy~0; [L27] havoc main_~zz~0; [L28] main_~z~0 := 0; [L29] main_~i~0 := 0; VAL [main_~i~0=0, main_~z~0=0] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=1] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=2] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=3] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=4] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=5] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=6] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=7] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=8] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=9] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=10] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=11] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=12] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=13] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=14] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=15] [L30-L33] COND FALSE !(!(main_~i~0 % 4294967296 < 16)) [L31] main_~z~0 := ~bitwiseOr(main_~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~0 % 65536, ~shiftLeft(1, main_~i~0)), main_~i~0), ~shiftLeft(~bitwiseAnd(main_~y~0 % 65536, ~shiftLeft(1, main_~i~0)), 1 + main_~i~0))); [L32] main_~i~0 := 1 + main_~i~0; VAL [main_~i~0=16] [L30-L33] COND TRUE !(main_~i~0 % 4294967296 < 16) [L34] main_~xx~0 := main_~x~0 % 65536; [L35] main_~yy~0 := main_~y~0 % 65536; [L36] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 256 * main_~xx~0), 16711935); [L37] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 16 * main_~xx~0), 252645135); [L38] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 4 * main_~xx~0), 858993459); [L39] main_~xx~0 := ~bitwiseAnd(~bitwiseOr(main_~xx~0, 2 * main_~xx~0), 1431655765); [L40] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 256 * main_~yy~0), 16711935); [L41] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 16 * main_~yy~0), 252645135); [L42] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 4 * main_~yy~0), 858993459); [L43] main_~yy~0 := ~bitwiseAnd(~bitwiseOr(main_~yy~0, 2 * main_~yy~0), 1431655765); [L45] main_~zz~0 := ~bitwiseOr(main_~xx~0, 2 * main_~yy~0); [L47] __VERIFIER_assert_#in~cond := (if main_~z~0 % 4294967296 == main_~zz~0 % 4294967296 then 1 else 0); [L47] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L6] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=16, main_~zz~0=1, main_~z~0=0] [L23] ~x~0 := #t~nondet0; [L23] havoc #t~nondet0; [L24] ~y~0 := #t~nondet1; [L24] havoc #t~nondet1; [L25] havoc ~xx~0; [L26] havoc ~yy~0; [L27] havoc ~zz~0; [L28] ~z~0 := 0; [L29] ~i~0 := 0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND TRUE !(~i~0 % 4294967296 < 16) [L34] ~xx~0 := ~x~0 % 65536; [L35] ~yy~0 := ~y~0 % 65536; [L36] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 256 * ~xx~0), 16711935); [L37] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 16 * ~xx~0), 252645135); [L38] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 4 * ~xx~0), 858993459); [L39] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 2 * ~xx~0), 1431655765); [L40] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 256 * ~yy~0), 16711935); [L41] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 16 * ~yy~0), 252645135); [L42] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 4 * ~yy~0), 858993459); [L43] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 2 * ~yy~0), 1431655765); [L45] ~zz~0 := ~bitwiseOr(~xx~0, 2 * ~yy~0); [L4-L9] ~cond := #in~cond; [L5] COND TRUE 0 == ~cond [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L23] ~x~0 := #t~nondet0; [L23] havoc #t~nondet0; [L24] ~y~0 := #t~nondet1; [L24] havoc #t~nondet1; [L25] havoc ~xx~0; [L26] havoc ~yy~0; [L27] havoc ~zz~0; [L28] ~z~0 := 0; [L29] ~i~0 := 0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND FALSE !(!(~i~0 % 4294967296 < 16)) [L31] ~z~0 := ~bitwiseOr(~z~0, ~bitwiseOr(~shiftLeft(~bitwiseAnd(~x~0 % 65536, ~shiftLeft(1, ~i~0)), ~i~0), ~shiftLeft(~bitwiseAnd(~y~0 % 65536, ~shiftLeft(1, ~i~0)), 1 + ~i~0))); [L32] ~i~0 := 1 + ~i~0; [L30-L33] COND TRUE !(~i~0 % 4294967296 < 16) [L34] ~xx~0 := ~x~0 % 65536; [L35] ~yy~0 := ~y~0 % 65536; [L36] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 256 * ~xx~0), 16711935); [L37] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 16 * ~xx~0), 252645135); [L38] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 4 * ~xx~0), 858993459); [L39] ~xx~0 := ~bitwiseAnd(~bitwiseOr(~xx~0, 2 * ~xx~0), 1431655765); [L40] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 256 * ~yy~0), 16711935); [L41] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 16 * ~yy~0), 252645135); [L42] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 4 * ~yy~0), 858993459); [L43] ~yy~0 := ~bitwiseAnd(~bitwiseOr(~yy~0, 2 * ~yy~0), 1431655765); [L45] ~zz~0 := ~bitwiseOr(~xx~0, 2 * ~yy~0); [L4-L9] ~cond := #in~cond; [L5] COND TRUE 0 == ~cond [L6] assert false; [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) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() ----- [2018-11-23 05:53:17,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:53:17 ImpRootNode [2018-11-23 05:53:17,857 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:53:17,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:53:17,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:53:17,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:53:17,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:14" (3/4) ... [2018-11-23 05:53:17,873 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:53:17,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:53:17,874 INFO L168 Benchmark]: Toolchain (without parser) took 3444.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -96.3 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,875 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:53:17,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.82 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,876 INFO L168 Benchmark]: Boogie Preprocessor took 14.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,877 INFO L168 Benchmark]: RCFGBuilder took 151.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,877 INFO L168 Benchmark]: CodeCheck took 3042.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:17,878 INFO L168 Benchmark]: Witness Printer took 16.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:53:17,881 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, 9 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 17 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98304 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 393208 SolverSat, 393208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 938 SyntacticMatches, 225 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5275 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 13372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 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) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.82 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 54.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * CodeCheck took 3042.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. * Witness Printer took 16.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 05:53:19,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:53:19,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:53:19,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:53:19,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:53:19,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:53:19,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:53:19,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:53:19,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:53:19,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:53:19,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:53:19,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:53:19,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:53:19,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:53:19,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:53:19,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:53:19,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:53:19,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:53:19,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:53:19,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:53:19,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:53:19,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:53:19,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:53:19,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:53:19,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:53:19,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:53:19,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:53:19,416 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:53:19,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:53:19,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:53:19,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:53:19,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:53:19,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:53:19,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:53:19,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:53:19,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:53:19,419 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 05:53:19,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:53:19,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:53:19,431 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:53:19,431 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 05:53:19,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:53:19,431 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:53:19,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:53:19,432 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:53:19,433 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:53:19,433 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:53:19,433 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:53:19,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:53:19,433 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:53:19,433 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:53:19,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:53:19,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 05:53:19,434 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:53:19,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:53:19,435 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:53:19,435 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:53:19,435 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_a76364da-5e15-4dc9-867b-11b0e6b68130/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-23 05:53:19,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:53:19,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:53:19,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:53:19,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:53:19,473 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:53:19,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-23 05:53:19,512 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/f2aa88f15/ae116c0a17cb4b83a63df3ae7a19e6d5/FLAGf2c444580 [2018-11-23 05:53:19,847 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:53:19,847 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-23 05:53:19,852 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/f2aa88f15/ae116c0a17cb4b83a63df3ae7a19e6d5/FLAGf2c444580 [2018-11-23 05:53:19,860 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/data/f2aa88f15/ae116c0a17cb4b83a63df3ae7a19e6d5 [2018-11-23 05:53:19,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:53:19,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:53:19,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:53:19,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:53:19,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:53:19,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:53:19" (1/1) ... [2018-11-23 05:53:19,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5242ae7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:19, skipping insertion in model container [2018-11-23 05:53:19,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:53:19" (1/1) ... [2018-11-23 05:53:19,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:53:19,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:53:20,021 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:53:20,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:53:20,040 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:53:20,052 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:53:20,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20 WrapperNode [2018-11-23 05:53:20,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:53:20,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:53:20,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:53:20,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:53:20,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:53:20,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:53:20,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:53:20,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:53:20,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:53:20,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:53:20,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:53:20,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:53:20,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:53:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:53:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:53:20,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:53:20,284 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:53:20,284 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 05:53:20,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:20 BoogieIcfgContainer [2018-11-23 05:53:20,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:53:20,284 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:53:20,285 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:53:20,292 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:53:20,292 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:20" (1/1) ... [2018-11-23 05:53:20,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:53:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 05:53:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 05:53:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:53:20,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,362 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-23 05:53:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-23 05:53:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 05:53:20,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,439 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-23 05:53:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-23 05:53:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 05:53:20,528 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,529 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 05:53:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 05:53:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 05:53:20,625 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,626 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 05:53:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 05:53:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 05:53:20,736 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,737 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 05:53:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 05:53:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:53:20,851 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,852 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 05:53:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 05:53:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:53:20,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:20,979 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:20,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 05:53:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 05:53:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:53:21,117 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:21,118 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:21,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 05:53:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 05:53:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:53:21,271 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:21,272 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:21,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 05:53:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 05:53:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:53:21,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:21,580 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 05:53:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 05:53:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:53:21,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:21,835 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:21,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 05:53:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 05:53:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:53:22,064 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:22,065 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:22,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 05:53:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 05:53:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:53:22,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:22,357 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:22,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 05:53:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 05:53:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:53:22,622 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:22,623 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:22,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 05:53:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 05:53:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:53:22,888 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:22,889 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:22,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 05:53:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 05:53:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:53:23,242 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:23,242 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:23,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 23 states and 22 transitions. [2018-11-23 05:53:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2018-11-23 05:53:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:53:23,585 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:53:23,586 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 05:53:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:53:23,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:53:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:53:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:53:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 21 states and 20 transitions. [2018-11-23 05:53:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 05:53:31,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:53:31,942 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 18 iterations. [2018-11-23 05:53:31,948 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 05:53:32,414 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-11-23 05:53:32,415 INFO L579 CodeCheckObserver]: Invariant with dag size 217 [2018-11-23 05:53:32,446 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 05:53:32,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:53:32 ImpRootNode [2018-11-23 05:53:32,446 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:53:32,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:53:32,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:53:32,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:53:32,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:53:20" (3/4) ... [2018-11-23 05:53:32,450 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:53:32,456 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 05:53:32,456 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 05:53:32,492 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a76364da-5e15-4dc9-867b-11b0e6b68130/bin-2019/ukojak/witness.graphml [2018-11-23 05:53:32,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:53:32,493 INFO L168 Benchmark]: Toolchain (without parser) took 12629.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,493 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:53:32,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,495 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:53:32,495 INFO L168 Benchmark]: RCFGBuilder took 191.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,496 INFO L168 Benchmark]: CodeCheck took 12161.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,496 INFO L168 Benchmark]: Witness Printer took 45.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:53:32,499 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, 9 locations, 1 error locations. SAFE Result, 11.6s OverallTime, 18 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196608 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 786590 SolverSat, 786458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 1245 SyntacticMatches, 31 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7885 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 47367 SizeOfPredicates, 25 NumberOfNonLiveVariables, 612 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 0/816 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))))) || (~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))))) || (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, 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)) || (~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 == ~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)) || (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: 1]: Loop Invariant Derived loop invariant: 1 * 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 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 20.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 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.97 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 191.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * CodeCheck took 12161.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...