./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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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-09 04:19:58,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:19:58,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:19:58,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:19:58,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:19:58,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:19:58,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:19:58,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:19:58,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:19:58,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:19:58,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:19:58,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:19:58,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:19:58,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:19:58,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:19:58,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:19:58,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:19:58,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:19:58,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:19:58,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:19:58,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:19:58,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:19:58,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:19:58,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:19:58,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:19:58,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:19:58,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:19:58,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:19:58,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:19:58,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:19:58,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:19:58,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:19:58,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:19:58,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:19:58,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:19:58,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:19:58,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 04:19:58,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:19:58,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:19:58,291 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:19:58,291 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 04:19:58,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:19:58,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:19:58,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:19:58,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:19:58,292 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 04:19:58,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 04:19:58,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:19:58,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:19:58,293 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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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-09 04:19:58,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:19:58,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:19:58,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:19:58,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:19:58,324 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:19:58,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-09 04:19:58,361 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/920aecbdf/19856f611bb049ee85ca9e3bd93f88c4/FLAGb274ca572 [2018-12-09 04:19:58,741 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:19:58,742 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-09 04:19:58,745 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/920aecbdf/19856f611bb049ee85ca9e3bd93f88c4/FLAGb274ca572 [2018-12-09 04:19:58,753 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/920aecbdf/19856f611bb049ee85ca9e3bd93f88c4 [2018-12-09 04:19:58,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:19:58,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:19:58,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:19:58,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:19:58,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:19:58,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15319f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58, skipping insertion in model container [2018-12-09 04:19:58,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:19:58,774 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:19:58,859 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:19:58,862 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:19:58,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:19:58,881 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:19:58,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58 WrapperNode [2018-12-09 04:19:58,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:19:58,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:19:58,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:19:58,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:19:58,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:19:58,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:19:58,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:19:58,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:19:58,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... [2018-12-09 04:19:58,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:19:58,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:19:58,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:19:58,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:19:58,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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-09 04:19:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:19:58,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:19:59,072 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:19:59,072 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 04:19:59,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:59 BoogieIcfgContainer [2018-12-09 04:19:59,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:19:59,073 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 04:19:59,073 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 04:19:59,080 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 04:19:59,080 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:59" (1/1) ... [2018-12-09 04:19:59,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-12-09 04:19:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-09 04:19:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-09 04:19:59,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,213 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-09 04:19:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-09 04:19:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-09 04:19:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 04:19:59,231 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,264 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-09 04:19:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-09 04:19:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-09 04:19:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 04:19:59,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,369 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-09 04:19:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-09 04:19:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-09 04:19:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 04:19:59,411 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,455 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-09 04:19:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-09 04:19:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-09 04:19:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 04:19:59,496 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,559 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-09 04:19:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-09 04:19:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-09 04:19:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 04:19:59,609 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,670 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-09 04:19:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-09 04:19:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-09 04:19:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:19:59,725 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,794 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-09 04:19:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:19:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-09 04:19:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-09 04:19:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 04:19:59,844 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:19:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:59,947 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-09 04:20:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-09 04:20:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-09 04:20:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:20:00,007 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:00,106 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-09 04:20:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-09 04:20:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-09 04:20:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 04:20:00,168 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:00,272 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-09 04:20:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-09 04:20:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-09 04:20:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 04:20:00,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:00,450 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-09 04:20:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-09 04:20:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-09 04:20:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 04:20:00,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:00,648 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-09 04:20:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-09 04:20:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-09 04:20:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 04:20:00,708 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:00,844 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-09 04:20:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-09 04:20:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-09 04:20:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 04:20:00,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:01,047 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-09 04:20:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-09 04:20:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-09 04:20:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 04:20:01,118 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:01,317 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-09 04:20:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-09 04:20:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-09 04:20:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 04:20:01,377 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:01,567 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-09 04:20:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-09 04:20:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-09 04:20:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:20:01,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:20:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:20:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:20:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:20:01,684 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. [2018-12-09 04:20:01,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 04:20:01 ImpRootNode [2018-12-09 04:20:01,705 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 04:20:01,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:20:01,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:20:01,706 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:20:01,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:59" (3/4) ... [2018-12-09 04:20:01,710 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 04:20:01,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:20:01,710 INFO L168 Benchmark]: Toolchain (without parser) took 2955.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 962.4 MB in the beginning and 895.7 MB in the end (delta: 66.8 MB). Peak memory consumption was 290.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,712 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:20:01,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.70 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,713 INFO L168 Benchmark]: Boogie Preprocessor took 42.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,714 INFO L168 Benchmark]: RCFGBuilder took 127.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,714 INFO L168 Benchmark]: CodeCheck took 2632.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 895.7 MB in the end (delta: 246.9 MB). Peak memory consumption was 308.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:01,715 INFO L168 Benchmark]: Witness Printer took 4.05 ms. Allocated memory is still 1.3 GB. Free memory is still 895.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:20:01,718 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.5s 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.6s 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.70 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.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 42.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 127.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * CodeCheck took 2632.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 895.7 MB in the end (delta: 246.9 MB). Peak memory consumption was 308.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.05 ms. Allocated memory is still 1.3 GB. Free memory is still 895.7 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:20:03,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:20:03,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:20:03,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:20:03,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:20:03,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:20:03,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:20:03,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:20:03,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:20:03,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:20:03,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:20:03,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:20:03,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:20:03,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:20:03,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:20:03,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:20:03,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:20:03,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:20:03,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:20:03,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:20:03,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:20:03,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:20:03,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:20:03,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:20:03,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:20:03,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:20:03,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:20:03,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:20:03,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:20:03,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:20:03,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:20:03,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:20:03,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:20:03,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:20:03,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:20:03,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:20:03,049 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-12-09 04:20:03,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:20:03,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:20:03,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:20:03,061 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 04:20:03,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:20:03,061 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:20:03,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:20:03,062 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:20:03,062 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:20:03,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:20:03,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:20:03,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:20:03,063 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:20:03,064 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 04:20:03,064 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 04:20:03,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:20:03,064 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:20:03,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 04:20:03,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 04:20:03,065 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 04:20:03,065 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_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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-09 04:20:03,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:20:03,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:20:03,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:20:03,098 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:20:03,098 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:20:03,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-09 04:20:03,133 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/951cec15f/f4c0c05ee7bc4ae98c51a522f7e8b48e/FLAG88ecf42b8 [2018-12-09 04:20:03,518 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:20:03,519 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-12-09 04:20:03,522 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/951cec15f/f4c0c05ee7bc4ae98c51a522f7e8b48e/FLAG88ecf42b8 [2018-12-09 04:20:03,531 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/data/951cec15f/f4c0c05ee7bc4ae98c51a522f7e8b48e [2018-12-09 04:20:03,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:20:03,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:20:03,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:20:03,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:20:03,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:20:03,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,538 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 09.12 04:20:03, skipping insertion in model container [2018-12-09 04:20:03,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:20:03,553 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:20:03,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:20:03,644 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:20:03,657 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:20:03,665 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:20:03,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03 WrapperNode [2018-12-09 04:20:03,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:20:03,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:20:03,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:20:03,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:20:03,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:20:03,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:20:03,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:20:03,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:20:03,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:20:03,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:20:03,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:20:03,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:20:03,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:20:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/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-09 04:20:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:20:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:20:03,887 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:20:03,888 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 04:20:03,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:20:03 BoogieIcfgContainer [2018-12-09 04:20:03,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:20:03,888 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 04:20:03,888 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 04:20:03,894 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 04:20:03,894 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:20:03" (1/1) ... [2018-12-09 04:20:03,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:20:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-12-09 04:20:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-09 04:20:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-09 04:20:03,922 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:03,955 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:03,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:03,985 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-09 04:20:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-09 04:20:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-09 04:20:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 04:20:04,009 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,010 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,029 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-09 04:20:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-09 04:20:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-09 04:20:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 04:20:04,078 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,078 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,098 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-09 04:20:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-09 04:20:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-09 04:20:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 04:20:04,148 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,149 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,179 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-09 04:20:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-09 04:20:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-09 04:20:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 04:20:04,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,231 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,279 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-09 04:20:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-09 04:20:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-09 04:20:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 04:20:04,355 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,356 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,413 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-09 04:20:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-09 04:20:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-09 04:20:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:20:04,504 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,505 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,580 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-09 04:20:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-09 04:20:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-09 04:20:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 04:20:04,671 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,672 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,716 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-09 04:20:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-09 04:20:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-09 04:20:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:20:04,808 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,808 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:04,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:04,883 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-09 04:20:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-09 04:20:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-09 04:20:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 04:20:04,987 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:04,988 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:05,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:05,056 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-09 04:20:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-09 04:20:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-09 04:20:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 04:20:05,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:05,186 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:05,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:05,281 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-09 04:20:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-09 04:20:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-09 04:20:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 04:20:05,468 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:05,469 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:05,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:05,599 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-09 04:20:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-09 04:20:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-09 04:20:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 04:20:05,762 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:05,763 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:05,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:05,852 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-09 04:20:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-09 04:20:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-09 04:20:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 04:20:06,038 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:06,039 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:06,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:06,156 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-09 04:20:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-09 04:20:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-09 04:20:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 04:20:06,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:06,340 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:06,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:06,417 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-09 04:20:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-09 04:20:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-09 04:20:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 04:20:06,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:06,580 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:06,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:06,690 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-09 04:20:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 23 states and 22 transitions. [2018-12-09 04:20:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2018-12-09 04:20:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:20:06,881 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 04:20:06,882 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-09 04:20:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:20:07,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:20:09,816 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-09 04:20:15,563 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 04:20:16,025 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-09 04:20:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 04:20:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 21 states and 20 transitions. [2018-12-09 04:20:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-12-09 04:20:16,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:20:16,285 WARN L428 CodeCheckObserver]: This Program is SAFE, Check terminated with 18 iterations. [2018-12-09 04:20:16,291 INFO L779 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-12-09 04:20:16,772 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 209 [2018-12-09 04:20:16,773 INFO L583 CodeCheckObserver]: Invariant with dag size 209 [2018-12-09 04:20:16,795 INFO L583 CodeCheckObserver]: Invariant with dag size 1 [2018-12-09 04:20:16,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 04:20:16 ImpRootNode [2018-12-09 04:20:16,796 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 04:20:16,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:20:16,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:20:16,797 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:20:16,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:20:03" (3/4) ... [2018-12-09 04:20:16,800 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 04:20:16,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 04:20:16,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 04:20:16,853 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_99769559-c2e5-4a5a-9b64-a2b3cd19d254/bin-2019/ukojak/witness.graphml [2018-12-09 04:20:16,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:20:16,854 INFO L168 Benchmark]: Toolchain (without parser) took 13321.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,855 INFO L168 Benchmark]: CDTParser took 0.12 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-09 04:20:16,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.76 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.89 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,856 INFO L168 Benchmark]: Boogie Preprocessor took 13.51 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:20:16,856 INFO L168 Benchmark]: RCFGBuilder took 187.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,856 INFO L168 Benchmark]: CodeCheck took 12908.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,856 INFO L168 Benchmark]: Witness Printer took 56.86 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.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-12-09 04:20:16,858 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.3s OverallTime, 18 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196608 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 786590 SolverSat, 786458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 1244 SyntacticMatches, 32 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7830 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s 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.12 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 131.76 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.89 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 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.51 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * CodeCheck took 12908.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.86 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.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...