./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b853b7a72b17d5b4054a16a7ba98c728e55c23b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:16:09,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:16:09,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:16:09,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:16:09,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:16:09,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:16:09,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:16:09,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:16:09,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:16:09,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:16:09,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:16:09,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:16:09,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:16:09,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:16:09,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:16:09,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:16:09,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:16:09,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:16:09,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:16:09,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:16:09,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:16:09,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:16:09,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:16:09,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:16:09,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:16:09,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:16:09,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:16:09,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:16:09,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:16:09,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:16:09,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:16:09,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:16:09,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:16:09,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:16:09,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:16:09,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:16:09,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:16:09,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:16:09,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:16:09,606 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:16:09,606 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:16:09,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:16:09,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:16:09,607 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:16:09,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:16:09,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:16:09,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:16:09,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:16:09,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:16:09,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:16:09,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:16:09,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:16:09,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:16:09,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:16:09,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:16:09,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:16:09,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:16:09,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:16:09,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:16:09,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:16:09,610 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_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer 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 -> Automizer 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 -> 6b853b7a72b17d5b4054a16a7ba98c728e55c23b [2018-11-23 02:16:09,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:16:09,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:16:09,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:16:09,646 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:16:09,647 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:16:09,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-23 02:16:09,687 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/data/5714b9f97/ccf13f1edaf7435d87596d41de8002a8/FLAG924e26cc4 [2018-11-23 02:16:10,070 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:16:10,070 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-23 02:16:10,073 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/data/5714b9f97/ccf13f1edaf7435d87596d41de8002a8/FLAG924e26cc4 [2018-11-23 02:16:10,083 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/data/5714b9f97/ccf13f1edaf7435d87596d41de8002a8 [2018-11-23 02:16:10,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:16:10,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:16:10,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:16:10,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:16:10,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:16:10,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c486bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10, skipping insertion in model container [2018-11-23 02:16:10,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:16:10,110 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:16:10,214 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:16:10,216 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:16:10,226 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:16:10,235 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:16:10,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10 WrapperNode [2018-11-23 02:16:10,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:16:10,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:16:10,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:16:10,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:16:10,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:16:10,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:16:10,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:16:10,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:16:10,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... [2018-11-23 02:16:10,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:16:10,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:16:10,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:16:10,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:16:10,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-23 02:16:10,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:16:10,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:16:10,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:16:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:16:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:16:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:16:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:16:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:16:10,454 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:16:10,454 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 02:16:10,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:10 BoogieIcfgContainer [2018-11-23 02:16:10,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:16:10,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:16:10,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:16:10,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:16:10,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:16:10" (1/3) ... [2018-11-23 02:16:10,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0f7edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:10, skipping insertion in model container [2018-11-23 02:16:10,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:10" (2/3) ... [2018-11-23 02:16:10,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0f7edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:10, skipping insertion in model container [2018-11-23 02:16:10,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:10" (3/3) ... [2018-11-23 02:16:10,462 INFO L112 eAbstractionObserver]: Analyzing ICFG id_trans_false-unreach-call_true-termination.i [2018-11-23 02:16:10,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:16:10,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:16:10,492 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:16:10,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:16:10,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:16:10,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:16:10,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:16:10,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:16:10,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:16:10,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:16:10,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:16:10,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:16:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 02:16:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 02:16:10,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:16:10,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:16:10,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:16:10,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1719634852, now seen corresponding path program 1 times [2018-11-23 02:16:10,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:10,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:16:10,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:16:10,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:16:10,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:16:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:16:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:16:10,719 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 02:16:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:10,791 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 02:16:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:16:10,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 02:16:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:16:10,798 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:16:10,798 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 02:16:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:16:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 02:16:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 02:16:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 02:16:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 02:16:10,827 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2018-11-23 02:16:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:16:10,827 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 02:16:10,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:16:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 02:16:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 02:16:10,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:16:10,829 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:16:10,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:16:10,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:10,830 INFO L82 PathProgramCache]: Analyzing trace with hash 769813017, now seen corresponding path program 1 times [2018-11-23 02:16:10,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:10,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:16:10,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:16:10,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:16:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:16:10,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:16:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:16:11,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:16:11,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-11-23 02:16:11,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:16:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:16:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:16:11,005 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2018-11-23 02:16:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:16:11,087 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 02:16:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:16:11,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 02:16:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:16:11,088 INFO L225 Difference]: With dead ends: 28 [2018-11-23 02:16:11,088 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 02:16:11,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:16:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 02:16:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 02:16:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 02:16:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 02:16:11,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2018-11-23 02:16:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:16:11,094 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 02:16:11,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:16:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 02:16:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:16:11,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:16:11,095 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:16:11,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:16:11,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:16:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 889343161, now seen corresponding path program 1 times [2018-11-23 02:16:11,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:16:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:16:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:16:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:16:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:16:11,139 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret5 := main(); [?] havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~idBitLength~0=8, main_~material_length~0=1, main_~nlen~0=0] [?] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #44#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #46#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #48#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32)); [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32)); [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L11] int idBitLength, material_length, nlen; [L12] int j, k; [L13] nlen = __VERIFIER_nondet_int() [L14] idBitLength = __VERIFIER_nondet_int() [L15] material_length = __VERIFIER_nondet_int() [L16] COND FALSE !(!( nlen == idBitLength / 32 )) [L17] j = 0 VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L17] COND TRUE (j < idBitLength / 8) && (j < material_length) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L18] CALL __VERIFIER_assert( 0 <= j) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert( 0 <= j) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L19] CALL __VERIFIER_assert( j < material_length ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L19] RET __VERIFIER_assert( j < material_length ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L20] CALL __VERIFIER_assert( 0 <= j/4 ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L20] RET __VERIFIER_assert( 0 <= j/4 ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L21] CALL __VERIFIER_assert( j/4 < nlen) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 02:16:11,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:16:11 BoogieIcfgContainer [2018-11-23 02:16:11,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:16:11,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:16:11,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:16:11,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:16:11,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:10" (3/4) ... [2018-11-23 02:16:11,169 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret5 := main(); [?] havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~idBitLength~0=8, main_~material_length~0=1, main_~nlen~0=0] [?] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #44#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #46#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #48#return; VAL [main_~idBitLength~0=8, main_~j~0=0, main_~material_length~0=1, main_~nlen~0=0] [?] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32)); [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32)); [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L11] havoc ~idBitLength~0; [L11] havoc ~material_length~0; [L11] havoc ~nlen~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~nlen~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L14] ~idBitLength~0 := #t~nondet2; [L14] havoc #t~nondet2; [L15] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L15] ~material_length~0 := #t~nondet3; [L15] havoc #t~nondet3; VAL [~idBitLength~0=8, ~material_length~0=1, ~nlen~0=0] [L16] COND FALSE !(!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32))) [L17] ~j~0 := 0; VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L17-L22] COND FALSE !(!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0)) VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L18] CALL call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L19] CALL call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L19] RET call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L20] CALL call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [#in~cond=1] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 <= (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) then 1 else 0)); VAL [~idBitLength~0=8, ~j~0=0, ~material_length~0=1, ~nlen~0=0] [L21] CALL call __VERIFIER_assert((if (if ~j~0 < 0 && 0 != ~j~0 % 4 then 1 + ~j~0 / 4 else ~j~0 / 4) < ~nlen~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L11] int idBitLength, material_length, nlen; [L12] int j, k; [L13] nlen = __VERIFIER_nondet_int() [L14] idBitLength = __VERIFIER_nondet_int() [L15] material_length = __VERIFIER_nondet_int() [L16] COND FALSE !(!( nlen == idBitLength / 32 )) [L17] j = 0 VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L17] COND TRUE (j < idBitLength / 8) && (j < material_length) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L18] CALL __VERIFIER_assert( 0 <= j) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert( 0 <= j) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L19] CALL __VERIFIER_assert( j < material_length ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L19] RET __VERIFIER_assert( j < material_length ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L20] CALL __VERIFIER_assert( 0 <= j/4 ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L20] RET __VERIFIER_assert( 0 <= j/4 ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L21] CALL __VERIFIER_assert( j/4 < nlen) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 02:16:11,204 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1921bae-7123-4221-9f14-ecef176abe85/bin-2019/uautomizer/witness.graphml [2018-11-23 02:16:11,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:16:11,205 INFO L168 Benchmark]: Toolchain (without parser) took 1118.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -87.1 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,205 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:16:11,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.28 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:16:11,206 INFO L168 Benchmark]: Boogie Preprocessor took 12.65 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,206 INFO L168 Benchmark]: RCFGBuilder took 193.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,207 INFO L168 Benchmark]: TraceAbstraction took 711.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,207 INFO L168 Benchmark]: Witness Printer took 37.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:16:11,210 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.28 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.65 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 711.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * Witness Printer took 37.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int idBitLength, material_length, nlen; [L12] int j, k; [L13] nlen = __VERIFIER_nondet_int() [L14] idBitLength = __VERIFIER_nondet_int() [L15] material_length = __VERIFIER_nondet_int() [L16] COND FALSE !(!( nlen == idBitLength / 32 )) [L17] j = 0 VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L17] COND TRUE (j < idBitLength / 8) && (j < material_length) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L18] CALL __VERIFIER_assert( 0 <= j) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert( 0 <= j) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L19] CALL __VERIFIER_assert( j < material_length ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L19] RET __VERIFIER_assert( j < material_length ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L20] CALL __VERIFIER_assert( 0 <= j/4 ) VAL [\old(cond)=1] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L20] RET __VERIFIER_assert( 0 <= j/4 ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L21] CALL __VERIFIER_assert( j/4 < nlen) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 21 SDslu, 120 SDs, 0 SdLazy, 93 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...