./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_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan --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 Taipan --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 07:41:48,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:41:48,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:41:48,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:41:48,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:41:48,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:41:48,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:41:48,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:41:48,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:41:48,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:41:48,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:41:48,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:41:48,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:41:48,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:41:48,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:41:48,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:41:48,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:41:48,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:41:48,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:41:48,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:41:48,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:41:48,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:41:48,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:41:48,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:41:48,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:41:48,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:41:48,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:41:48,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:41:48,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:41:48,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:41:48,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:41:48,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:41:48,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:41:48,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:41:48,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:41:48,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:41:48,465 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 07:41:48,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:41:48,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:41:48,477 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:41:48,477 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:41:48,477 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 07:41:48,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 07:41:48,477 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 07:41:48,477 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 07:41:48,477 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 07:41:48,478 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 07:41:48,478 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 07:41:48,478 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 07:41:48,478 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 07:41:48,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:41:48,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:41:48,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:41:48,480 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:41:48,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 07:41:48,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:41:48,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:41:48,482 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 07:41:48,482 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan 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 -> Taipan 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 07:41:48,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:41:48,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:41:48,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:41:48,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:41:48,515 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:41:48,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-23 07:41:48,553 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/data/3cbefdc36/8670a049080d4991b1d3f37ec0b5cbc4/FLAG0784b37bc [2018-11-23 07:41:48,886 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:41:48,887 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/sv-benchmarks/c/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-23 07:41:48,891 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/data/3cbefdc36/8670a049080d4991b1d3f37ec0b5cbc4/FLAG0784b37bc [2018-11-23 07:41:49,315 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/data/3cbefdc36/8670a049080d4991b1d3f37ec0b5cbc4 [2018-11-23 07:41:49,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:41:49,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:41:49,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:41:49,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:41:49,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:41:49,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a163e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49, skipping insertion in model container [2018-11-23 07:41:49,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:41:49,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:41:49,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:41:49,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:41:49,464 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:41:49,473 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:41:49,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49 WrapperNode [2018-11-23 07:41:49,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:41:49,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:41:49,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:41:49,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:41:49,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:41:49,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:41:49,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:41:49,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:41:49,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... [2018-11-23 07:41:49,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:41:49,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:41:49,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:41:49,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:41:49,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/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 07:41:49,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:41:49,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:41:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:41:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:41:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:41:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:41:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 07:41:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 07:41:49,675 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:41:49,675 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 07:41:49,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:41:49 BoogieIcfgContainer [2018-11-23 07:41:49,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:41:49,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:41:49,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:41:49,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:41:49,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:41:49" (1/3) ... [2018-11-23 07:41:49,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a4215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:41:49, skipping insertion in model container [2018-11-23 07:41:49,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:41:49" (2/3) ... [2018-11-23 07:41:49,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a4215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:41:49, skipping insertion in model container [2018-11-23 07:41:49,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:41:49" (3/3) ... [2018-11-23 07:41:49,681 INFO L112 eAbstractionObserver]: Analyzing ICFG id_trans_false-unreach-call_true-termination.i [2018-11-23 07:41:49,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:41:49,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:41:49,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:41:49,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:41:49,726 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:41:49,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:41:49,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:41:49,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:41:49,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:41:49,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:41:49,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:41:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 07:41:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:41:49,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:41:49,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:49,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:41:49,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1719634852, now seen corresponding path program 1 times [2018-11-23 07:41:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:41:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:49,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:49,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:41:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:49,869 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 07:41:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:49,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:41:49,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:41:49,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:41:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:41:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:41:49,884 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 07:41:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:49,954 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 07:41:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:41:49,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 07:41:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:41:49,961 INFO L225 Difference]: With dead ends: 46 [2018-11-23 07:41:49,961 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 07:41:49,964 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 07:41:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 07:41:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 07:41:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 07:41:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 07:41:49,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2018-11-23 07:41:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:41:49,992 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 07:41:49,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:41:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 07:41:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:41:49,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:41:49,993 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:49,994 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:41:49,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 769813017, now seen corresponding path program 1 times [2018-11-23 07:41:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:41:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:49,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:49,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:41:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:50,078 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 07:41:50,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:41:50,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:41:50,079 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-23 07:41:50,080 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [16], [28], [31], [33], [36], [38], [39], [40], [41], [43], [44], [45] [2018-11-23 07:41:50,102 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:41:50,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:41:50,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:41:50,194 INFO L272 AbstractInterpreter]: Visited 15 different actions 20 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 8. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 8 variables. [2018-11-23 07:41:50,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:50,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:41:50,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:41:50,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/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 07:41:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:50,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:41:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:50,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:41:50,270 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 07:41:50,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:41:50,308 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 07:41:50,324 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:41:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 10 [2018-11-23 07:41:50,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:41:50,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:41:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:41:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:41:50,326 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 07:41:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:50,365 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 07:41:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:41:50,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 07:41:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:41:50,367 INFO L225 Difference]: With dead ends: 28 [2018-11-23 07:41:50,367 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 07:41:50,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 07:41:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 07:41:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 07:41:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 07:41:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 07:41:50,374 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2018-11-23 07:41:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:41:50,374 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 07:41:50,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:41:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 07:41:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:41:50,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:41:50,375 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 07:41:50,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:41:50,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 889343161, now seen corresponding path program 1 times [2018-11-23 07:41:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:41:50,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:50,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:50,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:41:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:50,418 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 07:41:50,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:41:50 BoogieIcfgContainer [2018-11-23 07:41:50,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:41:50,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:41:50,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:41:50,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:41:50,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:41:49" (3/4) ... [2018-11-23 07:41:50,451 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 07:41:50,492 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3031d7bb-32c9-481f-b367-5e78ceef98f0/bin-2019/utaipan/witness.graphml [2018-11-23 07:41:50,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:41:50,492 INFO L168 Benchmark]: Toolchain (without parser) took 1174.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 958.0 MB in the beginning and 1.0 GB in the end (delta: -81.4 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,493 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:41:50,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.63 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,494 INFO L168 Benchmark]: Boogie Preprocessor took 13.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:41:50,494 INFO L168 Benchmark]: RCFGBuilder took 175.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,494 INFO L168 Benchmark]: TraceAbstraction took 771.84 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: 75.8 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,495 INFO L168 Benchmark]: Witness Printer took 43.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:50,501 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.63 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 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.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 175.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 771.84 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: 75.8 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. * Witness Printer took 43.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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.7s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 13 SDslu, 100 SDs, 0 SdLazy, 46 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 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.1s AbstIntTime, 1 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, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1485 SizeOfPredicates, 2 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...