java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-61f4311
[2018-11-23 13:09:16,252 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 13:09:16,254 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 13:09:16,266 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 13:09:16,266 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 13:09:16,267 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 13:09:16,269 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 13:09:16,270 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 13:09:16,272 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 13:09:16,273 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 13:09:16,274 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 13:09:16,274 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 13:09:16,275 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 13:09:16,276 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 13:09:16,277 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 13:09:16,278 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 13:09:16,279 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 13:09:16,281 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 13:09:16,283 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 13:09:16,284 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 13:09:16,285 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 13:09:16,287 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 13:09:16,289 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 13:09:16,290 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 13:09:16,290 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 13:09:16,291 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 13:09:16,292 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 13:09:16,293 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 13:09:16,293 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 13:09:16,295 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 13:09:16,295 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 13:09:16,296 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 13:09:16,296 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 13:09:16,296 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 13:09:16,297 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 13:09:16,298 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 13:09:16,298 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2018-11-23 13:09:16,313 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 13:09:16,313 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 13:09:16,314 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 13:09:16,314 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 13:09:16,315 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 13:09:16,315 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 13:09:16,315 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 13:09:16,315 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 13:09:16,316 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 13:09:16,317 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 13:09:16,317 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 13:09:16,317 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 13:09:16,317 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 13:09:16,317 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 13:09:16,318 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 13:09:16,318 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 13:09:16,318 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 13:09:16,318 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 13:09:16,318 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 13:09:16,319 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 13:09:16,319 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 13:09:16,319 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 13:09:16,319 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 13:09:16,319 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 13:09:16,319 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-23 13:09:16,320 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-23 13:09:16,362 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 13:09:16,375 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 13:09:16,379 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 13:09:16,380 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 13:09:16,381 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 13:09:16,382 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i
[2018-11-23 13:09:16,444 INFO  L221              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5bd6d91/a75ad8308c0746f3a54edcda88fd2eb5/FLAG8e89393e5
[2018-11-23 13:09:16,873 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 13:09:16,874 INFO  L161              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i
[2018-11-23 13:09:16,880 INFO  L355              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5bd6d91/a75ad8308c0746f3a54edcda88fd2eb5/FLAG8e89393e5
[2018-11-23 13:09:17,272 INFO  L363              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5bd6d91/a75ad8308c0746f3a54edcda88fd2eb5
[2018-11-23 13:09:17,281 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 13:09:17,282 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 13:09:17,283 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 13:09:17,283 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 13:09:17,287 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 13:09:17,289 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,292 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbe1046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17, skipping insertion in model container
[2018-11-23 13:09:17,292 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,302 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 13:09:17,325 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 13:09:17,564 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 13:09:17,569 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 13:09:17,593 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 13:09:17,613 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 13:09:17,614 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17 WrapperNode
[2018-11-23 13:09:17,614 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 13:09:17,615 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 13:09:17,615 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 13:09:17,615 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 13:09:17,625 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,631 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,636 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 13:09:17,636 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 13:09:17,637 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 13:09:17,637 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 13:09:17,646 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,646 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,647 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,647 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,653 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,658 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,660 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
[2018-11-23 13:09:17,661 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 13:09:17,662 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 13:09:17,662 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 13:09:17,662 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 13:09:17,663 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:09:17,779 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 13:09:17,779 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 13:09:17,780 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 13:09:17,781 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 13:09:17,781 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 13:09:17,781 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 13:09:17,781 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2018-11-23 13:09:17,781 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2018-11-23 13:09:18,319 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 13:09:18,319 INFO  L280             CfgBuilder]: Removed 1 assue(true) statements.
[2018-11-23 13:09:18,320 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:18 BoogieIcfgContainer
[2018-11-23 13:09:18,320 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 13:09:18,321 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 13:09:18,321 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 13:09:18,324 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 13:09:18,325 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:17" (1/3) ...
[2018-11-23 13:09:18,326 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41284e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:18, skipping insertion in model container
[2018-11-23 13:09:18,326 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:17" (2/3) ...
[2018-11-23 13:09:18,326 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41284e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:18, skipping insertion in model container
[2018-11-23 13:09:18,326 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:18" (3/3) ...
[2018-11-23 13:09:18,328 INFO  L112   eAbstractionObserver]: Analyzing ICFG id_trans_false-unreach-call_true-termination.i
[2018-11-23 13:09:18,338 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 13:09:18,346 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 13:09:18,360 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 13:09:18,393 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 13:09:18,394 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 13:09:18,394 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 13:09:18,394 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 13:09:18,394 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 13:09:18,394 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 13:09:18,395 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 13:09:18,395 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 13:09:18,395 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 13:09:18,416 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states.
[2018-11-23 13:09:18,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-11-23 13:09:18,422 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 13:09:18,423 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 13:09:18,425 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 13:09:18,431 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 13:09:18,432 INFO  L82        PathProgramCache]: Analyzing trace with hash 1719634852, now seen corresponding path program 1 times
[2018-11-23 13:09:18,434 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 13:09:18,434 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 13:09:18,483 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:18,483 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 13:09:18,484 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:18,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 13:09:18,756 INFO  L256        TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID
[2018-11-23 13:09:18,761 INFO  L273        TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2018-11-23 13:09:18,761 INFO  L268        TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #40#return; {26#true} is VALID
[2018-11-23 13:09:18,761 INFO  L256        TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID
[2018-11-23 13:09:18,762 INFO  L273        TraceCheckUtils]: 4: Hoare triple {26#true} 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; {26#true} is VALID
[2018-11-23 13:09:18,766 INFO  L273        TraceCheckUtils]: 5: Hoare triple {26#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; {28#(<= 0 main_~j~0)} is VALID
[2018-11-23 13:09:18,779 INFO  L273        TraceCheckUtils]: 6: Hoare triple {28#(<= 0 main_~j~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); {28#(<= 0 main_~j~0)} is VALID
[2018-11-23 13:09:18,792 INFO  L256        TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {29#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2018-11-23 13:09:18,805 INFO  L273        TraceCheckUtils]: 8: Hoare triple {29#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30#(= 1 __VERIFIER_assert_~cond)} is VALID
[2018-11-23 13:09:18,818 INFO  L273        TraceCheckUtils]: 9: Hoare triple {30#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27#false} is VALID
[2018-11-23 13:09:18,819 INFO  L273        TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID
[2018-11-23 13:09:18,822 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 13:09:18,824 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 13:09:18,824 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-23 13:09:18,830 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2018-11-23 13:09:18,833 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 13:09:18,841 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2018-11-23 13:09:18,953 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 13:09:18,953 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-23 13:09:18,963 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-23 13:09:18,964 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-23 13:09:18,966 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 5 states.
[2018-11-23 13:09:19,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:19,818 INFO  L93              Difference]: Finished difference Result 46 states and 61 transitions.
[2018-11-23 13:09:19,818 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 13:09:19,818 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2018-11-23 13:09:19,818 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 13:09:19,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 13:09:19,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions.
[2018-11-23 13:09:19,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 13:09:19,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions.
[2018-11-23 13:09:19,846 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions.
[2018-11-23 13:09:20,163 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 13:09:20,180 INFO  L225             Difference]: With dead ends: 46
[2018-11-23 13:09:20,181 INFO  L226             Difference]: Without dead ends: 22
[2018-11-23 13:09:20,185 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-23 13:09:20,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-11-23 13:09:20,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2018-11-23 13:09:20,346 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 13:09:20,347 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states.
[2018-11-23 13:09:20,347 INFO  L74              IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states.
[2018-11-23 13:09:20,347 INFO  L87              Difference]: Start difference. First operand 22 states. Second operand 22 states.
[2018-11-23 13:09:20,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:20,353 INFO  L93              Difference]: Finished difference Result 22 states and 24 transitions.
[2018-11-23 13:09:20,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions.
[2018-11-23 13:09:20,354 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 13:09:20,354 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 13:09:20,354 INFO  L74              IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states.
[2018-11-23 13:09:20,355 INFO  L87              Difference]: Start difference. First operand 22 states. Second operand 22 states.
[2018-11-23 13:09:20,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:20,359 INFO  L93              Difference]: Finished difference Result 22 states and 24 transitions.
[2018-11-23 13:09:20,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions.
[2018-11-23 13:09:20,360 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 13:09:20,360 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 13:09:20,360 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 13:09:20,360 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 13:09:20,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2018-11-23 13:09:20,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions.
[2018-11-23 13:09:20,366 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11
[2018-11-23 13:09:20,366 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 13:09:20,366 INFO  L480      AbstractCegarLoop]: Abstraction has 22 states and 24 transitions.
[2018-11-23 13:09:20,366 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-23 13:09:20,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions.
[2018-11-23 13:09:20,367 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-11-23 13:09:20,367 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 13:09:20,368 INFO  L402         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 13:09:20,368 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 13:09:20,368 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 13:09:20,369 INFO  L82        PathProgramCache]: Analyzing trace with hash 769813017, now seen corresponding path program 1 times
[2018-11-23 13:09:20,369 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 13:09:20,369 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 13:09:20,370 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:20,371 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 13:09:20,371 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:20,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 13:09:20,567 INFO  L256        TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID
[2018-11-23 13:09:20,568 INFO  L273        TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID
[2018-11-23 13:09:20,568 INFO  L268        TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #40#return; {175#true} is VALID
[2018-11-23 13:09:20,569 INFO  L256        TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret5 := main(); {175#true} is VALID
[2018-11-23 13:09:20,569 INFO  L273        TraceCheckUtils]: 4: Hoare triple {175#true} 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; {175#true} is VALID
[2018-11-23 13:09:20,570 INFO  L273        TraceCheckUtils]: 5: Hoare triple {175#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; {177#(<= 0 main_~j~0)} is VALID
[2018-11-23 13:09:20,571 INFO  L273        TraceCheckUtils]: 6: Hoare triple {177#(<= 0 main_~j~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); {178#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} is VALID
[2018-11-23 13:09:20,571 INFO  L256        TraceCheckUtils]: 7: Hoare triple {178#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {175#true} is VALID
[2018-11-23 13:09:20,572 INFO  L273        TraceCheckUtils]: 8: Hoare triple {175#true} ~cond := #in~cond; {179#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID
[2018-11-23 13:09:20,572 INFO  L273        TraceCheckUtils]: 9: Hoare triple {179#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2018-11-23 13:09:20,591 INFO  L273        TraceCheckUtils]: 10: Hoare triple {180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2018-11-23 13:09:20,605 INFO  L268        TraceCheckUtils]: 11: Hoare quadruple {180#(not (= |__VERIFIER_assert_#in~cond| 0))} {178#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} #44#return; {181#(< main_~j~0 main_~material_length~0)} is VALID
[2018-11-23 13:09:20,607 INFO  L256        TraceCheckUtils]: 12: Hoare triple {181#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); {180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2018-11-23 13:09:20,607 INFO  L273        TraceCheckUtils]: 13: Hoare triple {180#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {182#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2018-11-23 13:09:20,609 INFO  L273        TraceCheckUtils]: 14: Hoare triple {182#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {176#false} is VALID
[2018-11-23 13:09:20,609 INFO  L273        TraceCheckUtils]: 15: Hoare triple {176#false} assume !false; {176#false} is VALID
[2018-11-23 13:09:20,611 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 13:09:20,612 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-11-23 13:09:20,612 INFO  L223   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:09:20,630 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 13:09:20,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 13:09:20,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 13:09:20,693 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 13:09:20,824 INFO  L256        TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID
[2018-11-23 13:09:20,825 INFO  L273        TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID
[2018-11-23 13:09:20,825 INFO  L268        TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #40#return; {175#true} is VALID
[2018-11-23 13:09:20,825 INFO  L256        TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret5 := main(); {175#true} is VALID
[2018-11-23 13:09:20,826 INFO  L273        TraceCheckUtils]: 4: Hoare triple {175#true} 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; {175#true} is VALID
[2018-11-23 13:09:20,826 INFO  L273        TraceCheckUtils]: 5: Hoare triple {175#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; {175#true} is VALID
[2018-11-23 13:09:20,834 INFO  L273        TraceCheckUtils]: 6: Hoare triple {175#true} 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); {181#(< main_~j~0 main_~material_length~0)} is VALID
[2018-11-23 13:09:20,835 INFO  L256        TraceCheckUtils]: 7: Hoare triple {181#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {175#true} is VALID
[2018-11-23 13:09:20,835 INFO  L273        TraceCheckUtils]: 8: Hoare triple {175#true} ~cond := #in~cond; {175#true} is VALID
[2018-11-23 13:09:20,835 INFO  L273        TraceCheckUtils]: 9: Hoare triple {175#true} assume !(0 == ~cond); {175#true} is VALID
[2018-11-23 13:09:20,836 INFO  L273        TraceCheckUtils]: 10: Hoare triple {175#true} assume true; {175#true} is VALID
[2018-11-23 13:09:20,839 INFO  L268        TraceCheckUtils]: 11: Hoare quadruple {175#true} {181#(< main_~j~0 main_~material_length~0)} #44#return; {181#(< main_~j~0 main_~material_length~0)} is VALID
[2018-11-23 13:09:20,840 INFO  L256        TraceCheckUtils]: 12: Hoare triple {181#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); {222#(= |__VERIFIER_assert_#in~cond| 1)} is VALID
[2018-11-23 13:09:20,840 INFO  L273        TraceCheckUtils]: 13: Hoare triple {222#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {226#(= 1 __VERIFIER_assert_~cond)} is VALID
[2018-11-23 13:09:20,842 INFO  L273        TraceCheckUtils]: 14: Hoare triple {226#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {176#false} is VALID
[2018-11-23 13:09:20,842 INFO  L273        TraceCheckUtils]: 15: Hoare triple {176#false} assume !false; {176#false} is VALID
[2018-11-23 13:09:20,844 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 13:09:20,865 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-11-23 13:09:20,865 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10
[2018-11-23 13:09:20,866 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 16
[2018-11-23 13:09:20,867 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 13:09:20,867 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2018-11-23 13:09:20,969 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 13:09:20,969 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-11-23 13:09:20,969 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-11-23 13:09:20,970 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2018-11-23 13:09:20,970 INFO  L87              Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states.
[2018-11-23 13:09:21,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:21,633 INFO  L93              Difference]: Finished difference Result 28 states and 29 transitions.
[2018-11-23 13:09:21,634 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2018-11-23 13:09:21,634 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 16
[2018-11-23 13:09:21,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 13:09:21,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2018-11-23 13:09:21,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions.
[2018-11-23 13:09:21,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2018-11-23 13:09:21,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions.
[2018-11-23 13:09:21,648 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 26 transitions.
[2018-11-23 13:09:21,714 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 13:09:21,718 INFO  L225             Difference]: With dead ends: 28
[2018-11-23 13:09:21,718 INFO  L226             Difference]: Without dead ends: 26
[2018-11-23 13:09:21,719 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2018-11-23 13:09:21,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2018-11-23 13:09:21,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2018-11-23 13:09:21,753 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 13:09:21,753 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states.
[2018-11-23 13:09:21,754 INFO  L74              IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states.
[2018-11-23 13:09:21,754 INFO  L87              Difference]: Start difference. First operand 26 states. Second operand 26 states.
[2018-11-23 13:09:21,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:21,757 INFO  L93              Difference]: Finished difference Result 26 states and 27 transitions.
[2018-11-23 13:09:21,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions.
[2018-11-23 13:09:21,757 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 13:09:21,758 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 13:09:21,758 INFO  L74              IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states.
[2018-11-23 13:09:21,758 INFO  L87              Difference]: Start difference. First operand 26 states. Second operand 26 states.
[2018-11-23 13:09:21,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 13:09:21,761 INFO  L93              Difference]: Finished difference Result 26 states and 27 transitions.
[2018-11-23 13:09:21,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions.
[2018-11-23 13:09:21,762 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 13:09:21,762 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 13:09:21,762 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 13:09:21,762 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 13:09:21,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2018-11-23 13:09:21,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions.
[2018-11-23 13:09:21,765 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16
[2018-11-23 13:09:21,765 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 13:09:21,766 INFO  L480      AbstractCegarLoop]: Abstraction has 26 states and 27 transitions.
[2018-11-23 13:09:21,766 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-11-23 13:09:21,766 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions.
[2018-11-23 13:09:21,767 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-11-23 13:09:21,767 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 13:09:21,767 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 13:09:21,767 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 13:09:21,768 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 13:09:21,768 INFO  L82        PathProgramCache]: Analyzing trace with hash 889343161, now seen corresponding path program 1 times
[2018-11-23 13:09:21,768 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 13:09:21,768 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 13:09:21,769 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:21,769 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 13:09:21,770 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:09:21,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 13:09:21,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 13:09:21,894 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 13:09:21,934 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2018-11-23 13:09:21,934 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L16 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L16 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L4 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L4 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 13:09:21,935 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L5 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L5 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L4-2 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L17-3 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L18 has no Hoare annotation
[2018-11-23 13:09:21,936 WARN  L170   areAnnotationChecker]: L18 has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: L18-1 has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: L18-1 has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: L19 has no Hoare annotation
[2018-11-23 13:09:21,937 WARN  L170   areAnnotationChecker]: L19 has no Hoare annotation
[2018-11-23 13:09:21,938 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 13:09:21,938 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 13:09:21,938 WARN  L170   areAnnotationChecker]: L21 has no Hoare annotation
[2018-11-23 13:09:21,938 INFO  L163   areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2018-11-23 13:09:21,940 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:21 BoogieIcfgContainer
[2018-11-23 13:09:21,940 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 13:09:21,941 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 13:09:21,941 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 13:09:21,941 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 13:09:21,942 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:18" (3/4) ...
[2018-11-23 13:09:21,944 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 13:09:22,007 INFO  L145         WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/id_trans_false-unreach-call_true-termination.i-witness.graphml
[2018-11-23 13:09:22,008 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 13:09:22,009 INFO  L168              Benchmark]: Toolchain (without parser) took 4727.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -575.7 MB). Peak memory consumption was 161.5 MB. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,011 INFO  L168              Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,012 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 331.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,012 INFO  L168              Benchmark]: Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,013 INFO  L168              Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,013 INFO  L168              Benchmark]: RCFGBuilder took 658.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,014 INFO  L168              Benchmark]: TraceAbstraction took 3619.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 165.9 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,015 INFO  L168              Benchmark]: Witness Printer took 67.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB.
[2018-11-23 13:09:22,019 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - GenericResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 331.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 658.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 3619.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 165.9 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB.
 * Witness Printer took 67.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 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, 3.5s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 22 SDslu, 113 SDs, 0 SdLazy, 84 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s 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.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s 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...