./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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-635dfa2 [2018-12-01 22:49:04,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:49:04,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:49:04,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:49:04,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:49:04,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:49:04,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:49:04,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:49:04,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:49:04,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:49:04,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:49:04,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:49:04,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:49:04,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:49:04,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:49:04,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:49:04,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:49:04,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:49:04,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:49:04,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:49:04,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:49:04,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:49:04,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:49:04,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:49:04,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:49:04,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:49:04,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:49:04,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:49:04,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:49:04,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:49:04,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:49:04,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:49:04,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:49:04,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:49:04,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:49:04,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:49:04,930 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 22:49:04,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:49:04,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:49:04,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:49:04,938 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 22:49:04,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:49:04,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:49:04,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:49:04,940 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 22:49:04,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 22:49:04,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:49:04,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:49:04,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:49:04,941 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 22:49:04,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:49:04,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:49:04,941 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_d9a358fa-e009-4a2d-abdb-f719cb062f74/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-12-01 22:49:04,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:49:04,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:49:04,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:49:04,967 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:49:04,967 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:49:04,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-01 22:49:05,000 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/c681a7317/bd0df2c4a3144465807ee295ac295c34/FLAGd4ff2eb14 [2018-12-01 22:49:05,427 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:49:05,427 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-01 22:49:05,430 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/c681a7317/bd0df2c4a3144465807ee295ac295c34/FLAGd4ff2eb14 [2018-12-01 22:49:05,438 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/c681a7317/bd0df2c4a3144465807ee295ac295c34 [2018-12-01 22:49:05,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:49:05,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:49:05,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:49:05,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:49:05,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:49:05,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aeeb41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05, skipping insertion in model container [2018-12-01 22:49:05,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:49:05,459 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:49:05,551 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:49:05,553 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:49:05,565 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:49:05,573 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:49:05,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05 WrapperNode [2018-12-01 22:49:05,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:49:05,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:49:05,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:49:05,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:49:05,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:49:05,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:49:05,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:49:05,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:49:05,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:49:05,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:49:05,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:49:05,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:49:05,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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-12-01 22:49:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:49:05,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:49:05,766 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:49:05,766 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 22:49:05,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:05 BoogieIcfgContainer [2018-12-01 22:49:05,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:49:05,766 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 22:49:05,766 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 22:49:05,773 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 22:49:05,773 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:05" (1/1) ... [2018-12-01 22:49:05,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:49:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-12-01 22:49:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-01 22:49:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 22:49:05,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-01 22:49:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-01 22:49:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 22:49:05,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-01 22:49:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-01 22:49:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 22:49:06,004 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-01 22:49:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-01 22:49:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 22:49:06,105 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-01 22:49:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-01 22:49:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 22:49:06,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-01 22:49:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-01 22:49:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:49:06,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-01 22:49:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-01 22:49:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 22:49:06,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-01 22:49:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-01 22:49:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 22:49:06,576 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-01 22:49:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-01 22:49:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 22:49:06,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-01 22:49:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-01 22:49:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:49:06,907 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-01 22:49:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-01 22:49:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 22:49:07,085 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-01 22:49:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-01 22:49:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 22:49:07,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-01 22:49:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-01 22:49:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:49:07,444 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-01 22:49:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-01 22:49:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 22:49:07,640 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-01 22:49:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-01 22:49:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 22:49:07,877 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-01 22:49:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-01 22:49:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 22:49:08,156 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-01 22:49:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-01 22:49:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 22:49:08,416 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:49:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:49:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:49:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:49:08,478 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. [2018-12-01 22:49:08,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 10:49:08 ImpRootNode [2018-12-01 22:49:08,499 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 22:49:08,500 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:49:08,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:49:08,500 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:49:08,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:05" (3/4) ... [2018-12-01 22:49:08,504 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:49:08,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:49:08,505 INFO L168 Benchmark]: Toolchain (without parser) took 3064.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 957.1 MB in the beginning and 1.0 GB in the end (delta: -63.3 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,506 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:49:08,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,507 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,508 INFO L168 Benchmark]: RCFGBuilder took 123.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,508 INFO L168 Benchmark]: CodeCheck took 2733.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:08,509 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:49:08,513 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.6s 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.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 938 SyntacticMatches, 225 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5275 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 123.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * CodeCheck took 2733.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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-635dfa2 [2018-12-01 22:49:09,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:49:09,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:49:09,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:49:09,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:49:09,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:49:09,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:49:09,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:49:09,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:49:09,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:49:09,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:49:09,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:49:09,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:49:09,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:49:09,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:49:09,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:49:09,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:49:09,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:49:09,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:49:09,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:49:09,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:49:09,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:49:09,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:49:09,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:49:09,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:49:09,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:49:09,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:49:09,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:49:09,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:49:09,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:49:09,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:49:09,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:49:09,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:49:09,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:49:09,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:49:09,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:49:09,836 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-12-01 22:49:09,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:49:09,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:49:09,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:49:09,846 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 22:49:09,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:49:09,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:49:09,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:49:09,847 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 22:49:09,848 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 22:49:09,848 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:49:09,848 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:49:09,848 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:49:09,848 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:49:09,848 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 22:49:09,849 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 22:49:09,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:49:09,849 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:49:09,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 22:49:09,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:49:09,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 22:49:09,850 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-01 22:49:09,850 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_d9a358fa-e009-4a2d-abdb-f719cb062f74/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-12-01 22:49:09,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:49:09,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:49:09,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:49:09,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:49:09,889 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:49:09,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-01 22:49:09,935 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/2b2c0994d/d0d4c57acd754978a8dea3e4b3564cfb/FLAG56f68387b [2018-12-01 22:49:10,328 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:49:10,328 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-01 22:49:10,332 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/2b2c0994d/d0d4c57acd754978a8dea3e4b3564cfb/FLAG56f68387b [2018-12-01 22:49:10,340 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/data/2b2c0994d/d0d4c57acd754978a8dea3e4b3564cfb [2018-12-01 22:49:10,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:49:10,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:49:10,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:49:10,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:49:10,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:49:10,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499c3c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10, skipping insertion in model container [2018-12-01 22:49:10,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:49:10,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:49:10,464 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:49:10,468 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:49:10,483 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:49:10,493 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:49:10,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10 WrapperNode [2018-12-01 22:49:10,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:49:10,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:49:10,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:49:10,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:49:10,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:49:10,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:49:10,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:49:10,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:49:10,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:49:10,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:49:10,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:49:10,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:49:10,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:49:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/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-12-01 22:49:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:49:10,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:49:10,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:49:10,701 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 22:49:10,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:10 BoogieIcfgContainer [2018-12-01 22:49:10,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:49:10,702 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 22:49:10,702 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 22:49:10,708 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 22:49:10,708 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:10" (1/1) ... [2018-12-01 22:49:10,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:49:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-12-01 22:49:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-01 22:49:10,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-01 22:49:10,737 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:10,771 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:10,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-01 22:49:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-01 22:49:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-01 22:49:10,835 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:10,836 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:10,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-01 22:49:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-01 22:49:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 22:49:10,898 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:10,898 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:10,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-01 22:49:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-01 22:49:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 22:49:10,967 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:10,968 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:10,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-01 22:49:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-01 22:49:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 22:49:11,044 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,045 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-01 22:49:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-01 22:49:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:49:11,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,173 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-01 22:49:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-01 22:49:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 22:49:11,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,321 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-01 22:49:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-01 22:49:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 22:49:11,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,480 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-01 22:49:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-01 22:49:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 22:49:11,639 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,640 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-01 22:49:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-01 22:49:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:49:11,809 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,809 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:11,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-01 22:49:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-01 22:49:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 22:49:11,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:11,999 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:12,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-01 22:49:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-01 22:49:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 22:49:12,210 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:12,211 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:12,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-01 22:49:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-01 22:49:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:49:12,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:12,490 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:12,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-01 22:49:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-01 22:49:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 22:49:12,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:12,711 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-01 22:49:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-01 22:49:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 22:49:12,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:12,958 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:12,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-01 22:49:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-01 22:49:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 22:49:13,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:13,220 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:13,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 23 states and 22 transitions. [2018-12-01 22:49:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2018-12-01 22:49:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 22:49:13,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 22:49:13,529 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-01 22:49:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:49:13,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:49:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:49:22,371 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-01 22:49:22,864 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-01 22:49:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 22:49:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 21 states and 20 transitions. [2018-12-01 22:49:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-12-01 22:49:23,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 22:49:23,123 WARN L428 CodeCheckObserver]: This Program is SAFE, Check terminated with 18 iterations. [2018-12-01 22:49:23,129 INFO L779 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-12-01 22:49:23,597 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 209 [2018-12-01 22:49:23,599 INFO L583 CodeCheckObserver]: Invariant with dag size 209 [2018-12-01 22:49:23,618 INFO L583 CodeCheckObserver]: Invariant with dag size 1 [2018-12-01 22:49:23,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 10:49:23 ImpRootNode [2018-12-01 22:49:23,618 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 22:49:23,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:49:23,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:49:23,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:49:23,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:49:10" (3/4) ... [2018-12-01 22:49:23,622 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 22:49:23,628 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-01 22:49:23,628 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-01 22:49:23,660 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d9a358fa-e009-4a2d-abdb-f719cb062f74/bin-2019/ukojak/witness.graphml [2018-12-01 22:49:23,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:49:23,660 INFO L168 Benchmark]: Toolchain (without parser) took 13318.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,661 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:49:23,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.34 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.50 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,662 INFO L168 Benchmark]: Boogie Preprocessor took 13.12 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:49:23,662 INFO L168 Benchmark]: RCFGBuilder took 173.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,662 INFO L168 Benchmark]: CodeCheck took 12917.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 236.2 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,663 INFO L168 Benchmark]: Witness Printer took 40.95 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.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:49:23,664 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, 12.4s 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, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 1244 SyntacticMatches, 32 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7830 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 47577 SizeOfPredicates, 25 NumberOfNonLiveVariables, 646 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(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))) && ~bvadd64(i, 4294967287bv32) == 0bv32) || (~bvadd64(i, 4294967284bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))))) || (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)) || (~bvadd64(i, 4294967289bv32) == 0bv32 && ~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))) == z)) || (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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 16bv32 == i)) || (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))))) || (~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))))) || (14bv32 == i && 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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (~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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 10bv32 == 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 == 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(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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 8bv32 == i) - 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.34 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.50 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.12 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 173.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * CodeCheck took 12917.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 236.2 MB. Max. memory is 11.5 GB. * Witness Printer took 40.95 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.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...