./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/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_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/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_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/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_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/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-1dbac8b [2018-11-10 04:01:05,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:01:05,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:01:05,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:01:05,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:01:05,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:01:05,183 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:01:05,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:01:05,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:01:05,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:01:05,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:01:05,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:01:05,189 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:01:05,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:01:05,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:01:05,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:01:05,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:01:05,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:01:05,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:01:05,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:01:05,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:01:05,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:01:05,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:01:05,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:01:05,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:01:05,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:01:05,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:01:05,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:01:05,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:01:05,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:01:05,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:01:05,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:01:05,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:01:05,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:01:05,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:01:05,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:01:05,206 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:01:05,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:01:05,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:01:05,218 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:01:05,218 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:01:05,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:01:05,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:01:05,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:01:05,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:01:05,220 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:01:05,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:01:05,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:01:05,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:01:05,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:01:05,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:01:05,221 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:01:05,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:01:05,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:01:05,221 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_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-10 04:01:05,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:01:05,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:01:05,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:01:05,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:01:05,258 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:01:05,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 04:01:05,299 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/0c8f74d09/4b34f96452ff4cf3aadb3036dda47236/FLAG0b34c38b4 [2018-11-10 04:01:05,694 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:01:05,694 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 04:01:05,698 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/0c8f74d09/4b34f96452ff4cf3aadb3036dda47236/FLAG0b34c38b4 [2018-11-10 04:01:05,707 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/0c8f74d09/4b34f96452ff4cf3aadb3036dda47236 [2018-11-10 04:01:05,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:01:05,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:01:05,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:05,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:01:05,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:01:05,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3273a8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05, skipping insertion in model container [2018-11-10 04:01:05,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:01:05,734 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:01:05,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:05,838 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:01:05,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:05,862 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:01:05,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05 WrapperNode [2018-11-10 04:01:05,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:05,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:05,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:01:05,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:01:05,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:05,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:01:05,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:01:05,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:01:05,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... [2018-11-10 04:01:05,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:01:05,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:01:05,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:01:05,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:01:05,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:01:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:01:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:01:06,060 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:01:06,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:06 BoogieIcfgContainer [2018-11-10 04:01:06,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:01:06,061 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:01:06,061 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:01:06,067 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:01:06,068 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:06" (1/1) ... [2018-11-10 04:01:06,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-10 04:01:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-10 04:01:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-10 04:01:06,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-10 04:01:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-10 04:01:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-10 04:01:06,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-10 04:01:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-10 04:01:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 04:01:06,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 04:01:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 04:01:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 04:01:06,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 04:01:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 04:01:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:01:06,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-10 04:01:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-10 04:01:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 04:01:06,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-10 04:01:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-10 04:01:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 04:01:06,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 04:01:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 04:01:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:01:06,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-10 04:01:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-10 04:01:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:01:07,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 04:01:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 04:01:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:01:07,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:01:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:01:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:01:07,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-10 04:01:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-10 04:01:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:01:07,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-10 04:01:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-10 04:01:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:01:07,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 04:01:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 04:01:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:01:08,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-10 04:01:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-10 04:01:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 04:01:08,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-10 04:01:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-10 04:01:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:01:08,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-10 04:01:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-10 04:01:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:01:08,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-10 04:01:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-10 04:01:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:01:09,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:09,277 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 18 iterations. [2018-11-10 04:01:09,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:01:09 ImpRootNode [2018-11-10 04:01:09,297 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:01:09,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:01:09,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:01:09,298 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:01:09,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:06" (3/4) ... [2018-11-10 04:01:09,301 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:01:09,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:01:09,302 INFO L168 Benchmark]: Toolchain (without parser) took 3592.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -291.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:09,303 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:09,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:09,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.20 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 946.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:09,305 INFO L168 Benchmark]: Boogie Preprocessor took 12.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:09,305 INFO L168 Benchmark]: RCFGBuilder took 165.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.7 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:09,306 INFO L168 Benchmark]: CodeCheck took 3236.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -100.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:09,306 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:09,310 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. UNSAFE Result, 3.1s OverallTime, 18 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 655360 SDtfs, 262140 SDslu, 393208 SDs, 0 SdLazy, 655350 SolverSat, 393210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 1878 SyntacticMatches, 240 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 48576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1360 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND FALSE !(i < sizeof(x) * 8) [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) [L47] CALL __VERIFIER_assert(z == zz) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.20 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 946.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 165.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.7 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * CodeCheck took 3236.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -100.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:01:10,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:01:10,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:01:10,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:01:10,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:01:10,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:01:10,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:01:10,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:01:10,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:01:10,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:01:10,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:01:10,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:01:10,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:01:10,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:01:10,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:01:10,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:01:10,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:01:10,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:01:10,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:01:10,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:01:10,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:01:10,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:01:10,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:01:10,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:01:10,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:01:10,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:01:10,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:01:10,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:01:10,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:01:10,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:01:10,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:01:10,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:01:10,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:01:10,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:01:10,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:01:10,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:01:10,873 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-10 04:01:10,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:01:10,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:01:10,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:01:10,884 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:01:10,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:01:10,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:01:10,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:01:10,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:01:10,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:01:10,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:01:10,887 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:01:10,887 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:01:10,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:01:10,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:01:10,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:01:10,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 04:01:10,888 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 04:01:10,888 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_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-10 04:01:10,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:01:10,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:01:10,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:01:10,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:01:10,926 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:01:10,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 04:01:10,962 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/d73dcfa3c/217d74e56fb64805952c12a31305697c/FLAGefe4de39b [2018-11-10 04:01:11,268 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:01:11,268 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 04:01:11,273 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/d73dcfa3c/217d74e56fb64805952c12a31305697c/FLAGefe4de39b [2018-11-10 04:01:11,281 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/data/d73dcfa3c/217d74e56fb64805952c12a31305697c [2018-11-10 04:01:11,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:01:11,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:01:11,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:11,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:01:11,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:01:11,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237d22e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11, skipping insertion in model container [2018-11-10 04:01:11,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:01:11,312 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:01:11,440 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:11,443 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:01:11,460 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:11,470 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:01:11,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11 WrapperNode [2018-11-10 04:01:11,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:11,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:11,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:01:11,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:01:11,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:11,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:01:11,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:01:11,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:01:11,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:01:11,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:01:11,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:01:11,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:01:11,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:01:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:01:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:01:11,704 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:01:11,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:11 BoogieIcfgContainer [2018-11-10 04:01:11,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:01:11,704 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:01:11,704 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:01:11,713 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:01:11,713 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:11" (1/1) ... [2018-11-10 04:01:11,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-10 04:01:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-10 04:01:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-10 04:01:11,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:11,780 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:11,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-10 04:01:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-10 04:01:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-10 04:01:11,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:11,811 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:11,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-10 04:01:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-10 04:01:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 04:01:11,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:11,868 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:11,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 04:01:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 04:01:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 04:01:11,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:11,973 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:11,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 04:01:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 04:01:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:01:12,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,076 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-10 04:01:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-10 04:01:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 04:01:12,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,199 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-10 04:01:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-10 04:01:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 04:01:12,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,354 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 04:01:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 04:01:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:01:12,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,561 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-10 04:01:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-10 04:01:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:01:12,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,753 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 04:01:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 04:01:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:01:12,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:12,958 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:01:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:01:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:01:13,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:13,180 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:13,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-10 04:01:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-10 04:01:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:01:13,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:13,374 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:13,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-10 04:01:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-10 04:01:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:01:13,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:13,603 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:13,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 04:01:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 04:01:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:01:13,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:13,884 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:13,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-10 04:01:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-10 04:01:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 04:01:14,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:14,127 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:14,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-10 04:01:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-10 04:01:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:01:14,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:14,390 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:14,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-10 04:01:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-10 04:01:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:01:14,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:14,705 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:14,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 41 states and 40 transitions. [2018-11-10 04:01:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-11-10 04:01:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:01:15,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:01:15,060 ERROR L616 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-10 04:01:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:15,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:01:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 39 states and 38 transitions. [2018-11-10 04:01:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 38 transitions. [2018-11-10 04:01:24,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:01:24,327 WARN L425 CodeCheckObserver]: This Program is SAFE, Check terminated with 19 iterations. [2018-11-10 04:01:24,332 INFO L778 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-10 04:01:24,824 WARN L179 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-11-10 04:01:25,326 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-11-10 04:01:25,327 INFO L582 CodeCheckObserver]: Invariant with dag size 217 [2018-11-10 04:01:25,359 INFO L582 CodeCheckObserver]: Invariant with dag size 1 [2018-11-10 04:01:25,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:01:25 ImpRootNode [2018-11-10 04:01:25,360 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:01:25,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:01:25,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:01:25,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:01:25,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:11" (3/4) ... [2018-11-10 04:01:25,366 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:01:25,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 04:01:25,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 04:01:25,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:01:25,430 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ab8c169-aab6-427a-aa46-7972e96664b9/bin-2019/ukojak/witness.graphml [2018-11-10 04:01:25,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:01:25,431 INFO L168 Benchmark]: Toolchain (without parser) took 14146.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 950.8 MB in the beginning and 836.8 MB in the end (delta: 114.0 MB). Peak memory consumption was 446.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:25,431 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:25,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.96 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:25,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.90 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:25,432 INFO L168 Benchmark]: Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:25,432 INFO L168 Benchmark]: RCFGBuilder took 196.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:25,433 INFO L168 Benchmark]: CodeCheck took 13655.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 847.0 MB in the end (delta: 290.5 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:25,433 INFO L168 Benchmark]: Witness Printer took 69.45 ms. Allocated memory is still 1.4 GB. Free memory was 847.0 MB in the beginning and 836.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:25,435 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 19 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1310720 SDtfs, 524350 SDslu, 786552 SDs, 0 SdLazy, 1310882 SolverSat, 786464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2678 GetRequests, 2513 SyntacticMatches, 31 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8095 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 192049 SizeOfPredicates, 25 NumberOfNonLiveVariables, 777 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1632 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) && ~bvadd64(i, 4294967285bv32) == 0bv32) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32))) && ~bvadd64(i, 4294967280bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))) && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (~bvadd64(i, 4294967283bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))) && ~bvadd64(i, 4294967288bv32) == 0bv32)) || (~bvadd64(i, 4294967294bv32) == 0bv32 && z == ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))))) || (7bv32 == i && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (~bvadd64(i, 4294967282bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 9bv32 == i)) || (~bvadd64(i, 4294967291bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z)) || (~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, 4294967295bv32) == 0bv32 && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))))) || (~bvadd64(i, 4294967290bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 12bv32 == i)) || (z == 0bv32 && i == 0bv32)) || (~bvadd64(i, 4294967281bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))) && ~bvadd64(i, 4294967286bv32) == 0bv32) - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.96 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.90 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 196.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * CodeCheck took 13655.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 847.0 MB in the end (delta: 290.5 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. * Witness Printer took 69.45 ms. Allocated memory is still 1.4 GB. Free memory was 847.0 MB in the beginning and 836.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...