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_Bitvector.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 11:32:16,654 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 11:32:16,656 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 11:32:16,671 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 11:32:16,671 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 11:32:16,673 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 11:32:16,675 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 11:32:16,678 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 11:32:16,680 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 11:32:16,681 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 11:32:16,683 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 11:32:16,684 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 11:32:16,685 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 11:32:16,686 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 11:32:16,692 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 11:32:16,693 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 11:32:16,694 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 11:32:16,698 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 11:32:16,700 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 11:32:16,703 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 11:32:16,704 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 11:32:16,707 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 11:32:16,711 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 11:32:16,711 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 11:32:16,712 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 11:32:16,713 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 11:32:16,714 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 11:32:16,717 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 11:32:16,718 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 11:32:16,721 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 11:32:16,721 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 11:32:16,722 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 11:32:16,722 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 11:32:16,722 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 11:32:16,724 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 11:32:16,727 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 11:32:16,727 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2018-11-23 11:32:16,751 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 11:32:16,751 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 11:32:16,752 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 11:32:16,752 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 11:32:16,753 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 11:32:16,753 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 11:32:16,754 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 11:32:16,754 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 11:32:16,754 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 11:32:16,754 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 11:32:16,755 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 11:32:16,755 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 11:32:16,755 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 11:32:16,755 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 11:32:16,755 INFO  L133        SettingsManager]:  * Use bitvectors instead of ints=true
[2018-11-23 11:32:16,756 INFO  L133        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2018-11-23 11:32:16,756 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 11:32:16,756 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 11:32:16,756 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 11:32:16,756 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 11:32:16,757 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 11:32:16,757 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 11:32:16,757 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 11:32:16,757 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 11:32:16,757 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 11:32:16,758 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 11:32:16,758 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 11:32:16,758 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 11:32:16,758 INFO  L133        SettingsManager]:  * Trace refinement strategy=WOLF
[2018-11-23 11:32:16,759 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 11:32:16,759 INFO  L133        SettingsManager]:  * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt
[2018-11-23 11:32:16,759 INFO  L133        SettingsManager]:  * Logic for external solver=AUFBV
[2018-11-23 11:32:16,759 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-23 11:32:16,805 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 11:32:16,818 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 11:32:16,822 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 11:32:16,824 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 11:32:16,825 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 11:32:16,826 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 11:32:16,891 INFO  L221              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fc9319b/f1c25ec61e9e4f86bad04c14e54371ae/FLAG7cefad556
[2018-11-23 11:32:17,404 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 11:32:17,405 INFO  L161              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i
[2018-11-23 11:32:17,411 INFO  L355              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fc9319b/f1c25ec61e9e4f86bad04c14e54371ae/FLAG7cefad556
[2018-11-23 11:32:17,751 INFO  L363              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fc9319b/f1c25ec61e9e4f86bad04c14e54371ae
[2018-11-23 11:32:17,762 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 11:32:17,764 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 11:32:17,765 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 11:32:17,765 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 11:32:17,769 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 11:32:17,771 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ...
[2018-11-23 11:32:17,774 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44aa645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:17, skipping insertion in model container
[2018-11-23 11:32:17,774 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:17" (1/1) ...
[2018-11-23 11:32:17,785 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 11:32:17,811 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 11:32:18,077 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 11:32:18,085 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 11:32:18,113 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 11:32:18,137 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 11:32:18,137 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18 WrapperNode
[2018-11-23 11:32:18,138 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 11:32:18,141 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 11:32:18,141 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 11:32:18,141 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 11:32:18,152 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,161 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,169 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 11:32:18,169 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 11:32:18,169 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 11:32:18,170 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 11:32:18,182 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,182 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,184 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,184 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,199 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,205 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,207 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (1/1) ...
[2018-11-23 11:32:18,213 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 11:32:18,214 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 11:32:18,214 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 11:32:18,214 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 11:32:18,215 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (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 11:32:18,352 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 11:32:18,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 11:32:18,352 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 11:32:18,352 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 11:32:18,352 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 11:32:18,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 11:32:18,353 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2018-11-23 11:32:18,353 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2018-11-23 11:32:18,883 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 11:32:18,883 INFO  L280             CfgBuilder]: Removed 1 assue(true) statements.
[2018-11-23 11:32:18,884 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:18 BoogieIcfgContainer
[2018-11-23 11:32:18,884 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 11:32:18,885 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 11:32:18,885 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 11:32:18,893 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 11:32:18,893 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:17" (1/3) ...
[2018-11-23 11:32:18,894 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d34a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:18, skipping insertion in model container
[2018-11-23 11:32:18,895 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:18" (2/3) ...
[2018-11-23 11:32:18,895 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d34a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:18, skipping insertion in model container
[2018-11-23 11:32:18,895 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:18" (3/3) ...
[2018-11-23 11:32:18,898 INFO  L112   eAbstractionObserver]: Analyzing ICFG id_trans_false-unreach-call_true-termination.i
[2018-11-23 11:32:18,909 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 11:32:18,917 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 11:32:18,934 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 11:32:18,965 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 11:32:18,966 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 11:32:18,966 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 11:32:18,967 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 11:32:18,967 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 11:32:18,967 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 11:32:18,967 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 11:32:18,968 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 11:32:18,968 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 11:32:18,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states.
[2018-11-23 11:32:18,993 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-11-23 11:32:18,993 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:32:18,994 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 11:32:18,997 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:32:19,003 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:32:19,004 INFO  L82        PathProgramCache]: Analyzing trace with hash 1719634852, now seen corresponding path program 1 times
[2018-11-23 11:32:19,008 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:32:19,008 INFO  L69    tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu
Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk
[2018-11-23 11:32:19,027 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:32:19,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:32:19,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:32:19,089 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 11:32:19,280 INFO  L256        TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID
[2018-11-23 11:32:19,284 INFO  L273        TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2018-11-23 11:32:19,285 INFO  L268        TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #40#return; {26#true} is VALID
[2018-11-23 11:32:19,285 INFO  L256        TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID
[2018-11-23 11:32:19,286 INFO  L273        TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;~nlen~0 := #t~nondet1;havoc #t~nondet1;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;~material_length~0 := #t~nondet3;havoc #t~nondet3; {26#true} is VALID
[2018-11-23 11:32:19,294 INFO  L273        TraceCheckUtils]: 5: Hoare triple {26#true} assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));~j~0 := 0bv32; {46#(= main_~j~0 (_ bv0 32))} is VALID
[2018-11-23 11:32:19,296 INFO  L273        TraceCheckUtils]: 6: Hoare triple {46#(= main_~j~0 (_ bv0 32))} assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)); {46#(= main_~j~0 (_ bv0 32))} is VALID
[2018-11-23 11:32:19,298 INFO  L256        TraceCheckUtils]: 7: Hoare triple {46#(= main_~j~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32)); {53#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID
[2018-11-23 11:32:19,304 INFO  L273        TraceCheckUtils]: 8: Hoare triple {53#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {57#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID
[2018-11-23 11:32:19,311 INFO  L273        TraceCheckUtils]: 9: Hoare triple {57#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {27#false} is VALID
[2018-11-23 11:32:19,311 INFO  L273        TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID
[2018-11-23 11:32:19,315 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 11:32:19,315 INFO  L312         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe
[2018-11-23 11:32:19,325 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 11:32:19,325 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-23 11:32:19,332 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2018-11-23 11:32:19,340 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 11:32:19,345 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2018-11-23 11:32:19,423 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 11:32:19,423 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-23 11:32:19,434 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-23 11:32:19,435 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-23 11:32:19,437 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 5 states.
[2018-11-23 11:32:20,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:20,769 INFO  L93              Difference]: Finished difference Result 53 states and 78 transitions.
[2018-11-23 11:32:20,769 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 11:32:20,769 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2018-11-23 11:32:20,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 11:32:20,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:32:20,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions.
[2018-11-23 11:32:20,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:32:20,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions.
[2018-11-23 11:32:20,791 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions.
[2018-11-23 11:32:21,723 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 11:32:21,735 INFO  L225             Difference]: With dead ends: 53
[2018-11-23 11:32:21,736 INFO  L226             Difference]: Without dead ends: 28
[2018-11-23 11:32:21,740 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 11:32:21,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2018-11-23 11:32:21,810 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26.
[2018-11-23 11:32:21,810 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 11:32:21,811 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states.
[2018-11-23 11:32:21,811 INFO  L74              IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states.
[2018-11-23 11:32:21,812 INFO  L87              Difference]: Start difference. First operand 28 states. Second operand 26 states.
[2018-11-23 11:32:21,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:21,819 INFO  L93              Difference]: Finished difference Result 28 states and 34 transitions.
[2018-11-23 11:32:21,819 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2018-11-23 11:32:21,820 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:32:21,821 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:32:21,821 INFO  L74              IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states.
[2018-11-23 11:32:21,821 INFO  L87              Difference]: Start difference. First operand 26 states. Second operand 28 states.
[2018-11-23 11:32:21,826 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:21,827 INFO  L93              Difference]: Finished difference Result 28 states and 34 transitions.
[2018-11-23 11:32:21,827 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2018-11-23 11:32:21,828 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:32:21,828 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:32:21,829 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 11:32:21,829 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 11:32:21,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2018-11-23 11:32:21,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions.
[2018-11-23 11:32:21,835 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11
[2018-11-23 11:32:21,836 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 11:32:21,836 INFO  L480      AbstractCegarLoop]: Abstraction has 26 states and 31 transitions.
[2018-11-23 11:32:21,836 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-23 11:32:21,836 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2018-11-23 11:32:21,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-11-23 11:32:21,837 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:32:21,837 INFO  L402         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 11:32:21,838 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:32:21,838 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:32:21,838 INFO  L82        PathProgramCache]: Analyzing trace with hash 769813017, now seen corresponding path program 1 times
[2018-11-23 11:32:21,839 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:32:21,839 INFO  L69    tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu
Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk
[2018-11-23 11:32:21,860 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:32:21,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:32:21,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:32:21,883 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 11:32:22,071 INFO  L256        TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID
[2018-11-23 11:32:22,072 INFO  L273        TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID
[2018-11-23 11:32:22,072 INFO  L268        TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #40#return; {237#true} is VALID
[2018-11-23 11:32:22,072 INFO  L256        TraceCheckUtils]: 3: Hoare triple {237#true} call #t~ret5 := main(); {237#true} is VALID
[2018-11-23 11:32:22,073 INFO  L273        TraceCheckUtils]: 4: Hoare triple {237#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;~nlen~0 := #t~nondet1;havoc #t~nondet1;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;~material_length~0 := #t~nondet3;havoc #t~nondet3; {237#true} is VALID
[2018-11-23 11:32:22,073 INFO  L273        TraceCheckUtils]: 5: Hoare triple {237#true} assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));~j~0 := 0bv32; {237#true} is VALID
[2018-11-23 11:32:22,076 INFO  L273        TraceCheckUtils]: 6: Hoare triple {237#true} assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)); {260#(bvslt main_~j~0 main_~material_length~0)} is VALID
[2018-11-23 11:32:22,076 INFO  L256        TraceCheckUtils]: 7: Hoare triple {260#(bvslt main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32)); {237#true} is VALID
[2018-11-23 11:32:22,076 INFO  L273        TraceCheckUtils]: 8: Hoare triple {237#true} ~cond := #in~cond; {237#true} is VALID
[2018-11-23 11:32:22,077 INFO  L273        TraceCheckUtils]: 9: Hoare triple {237#true} assume !(0bv32 == ~cond); {237#true} is VALID
[2018-11-23 11:32:22,077 INFO  L273        TraceCheckUtils]: 10: Hoare triple {237#true} assume true; {237#true} is VALID
[2018-11-23 11:32:22,078 INFO  L268        TraceCheckUtils]: 11: Hoare quadruple {237#true} {260#(bvslt main_~j~0 main_~material_length~0)} #44#return; {260#(bvslt main_~j~0 main_~material_length~0)} is VALID
[2018-11-23 11:32:22,096 INFO  L256        TraceCheckUtils]: 12: Hoare triple {260#(bvslt main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32)); {279#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID
[2018-11-23 11:32:22,112 INFO  L273        TraceCheckUtils]: 13: Hoare triple {279#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {283#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID
[2018-11-23 11:32:22,129 INFO  L273        TraceCheckUtils]: 14: Hoare triple {283#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {238#false} is VALID
[2018-11-23 11:32:22,129 INFO  L273        TraceCheckUtils]: 15: Hoare triple {238#false} assume !false; {238#false} is VALID
[2018-11-23 11:32:22,131 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 11:32:22,134 INFO  L312         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2018-11-23 11:32:22,136 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 11:32:22,136 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-23 11:32:22,138 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2018-11-23 11:32:22,139 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 11:32:22,139 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2018-11-23 11:32:22,197 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 11:32:22,197 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-23 11:32:22,198 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-23 11:32:22,198 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-23 11:32:22,198 INFO  L87              Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 5 states.
[2018-11-23 11:32:22,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:22,937 INFO  L93              Difference]: Finished difference Result 32 states and 36 transitions.
[2018-11-23 11:32:22,938 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 11:32:22,938 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2018-11-23 11:32:22,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 11:32:22,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:32:22,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2018-11-23 11:32:22,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:32:22,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2018-11-23 11:32:22,944 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions.
[2018-11-23 11:32:23,074 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 11:32:23,076 INFO  L225             Difference]: With dead ends: 32
[2018-11-23 11:32:23,076 INFO  L226             Difference]: Without dead ends: 30
[2018-11-23 11:32:23,077 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-23 11:32:23,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-11-23 11:32:23,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-11-23 11:32:23,115 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 11:32:23,115 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states.
[2018-11-23 11:32:23,116 INFO  L74              IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2018-11-23 11:32:23,116 INFO  L87              Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2018-11-23 11:32:23,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:23,120 INFO  L93              Difference]: Finished difference Result 30 states and 34 transitions.
[2018-11-23 11:32:23,121 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2018-11-23 11:32:23,121 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:32:23,122 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:32:23,122 INFO  L74              IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2018-11-23 11:32:23,122 INFO  L87              Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2018-11-23 11:32:23,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:32:23,126 INFO  L93              Difference]: Finished difference Result 30 states and 34 transitions.
[2018-11-23 11:32:23,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2018-11-23 11:32:23,127 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:32:23,127 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:32:23,127 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 11:32:23,128 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 11:32:23,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-11-23 11:32:23,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions.
[2018-11-23 11:32:23,131 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16
[2018-11-23 11:32:23,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 11:32:23,132 INFO  L480      AbstractCegarLoop]: Abstraction has 30 states and 34 transitions.
[2018-11-23 11:32:23,132 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-23 11:32:23,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2018-11-23 11:32:23,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-11-23 11:32:23,133 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:32:23,133 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 11:32:23,134 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:32:23,134 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:32:23,134 INFO  L82        PathProgramCache]: Analyzing trace with hash 889343161, now seen corresponding path program 1 times
[2018-11-23 11:32:23,135 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:32:23,135 INFO  L69    tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu
Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk
[2018-11-23 11:32:23,162 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:32:23,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 11:32:23,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe
[2018-11-23 11:32:23,305 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;~nlen~0 := #t~nondet1;havoc #t~nondet1;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;~material_length~0 := #t~nondet3;havoc #t~nondet3;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]        assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));~j~0 := 0bv32;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #44#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #46#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #48#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        assume 0bv32 == ~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        assume !false;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]


[?]        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]            ~nlen~0 := #t~nondet1;
[L13]            havoc #t~nondet1;
[L14]            ~idBitLength~0 := #t~nondet2;
[L14]            havoc #t~nondet2;
[L15]            ~material_length~0 := #t~nondet3;
[L15]            havoc #t~nondet3;
           VAL   [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]            assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));
[L17]            ~j~0 := 0bv32;
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET   call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=0bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L4-L6]          assume 0bv32 == ~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L5]             assert false;
           VAL   [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]            ~nlen~0 := #t~nondet1;
[L13]            havoc #t~nondet1;
[L14]            ~idBitLength~0 := #t~nondet2;
[L14]            havoc #t~nondet2;
[L15]            ~material_length~0 := #t~nondet3;
[L15]            havoc #t~nondet3;
           VAL   [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]            assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));
[L17]            ~j~0 := 0bv32;
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET   call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=0bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L4-L6]          assume 0bv32 == ~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L5]             assert false;
           VAL   [#in~cond=0bv32, ~cond=0bv32]


[?]        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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]


[?]        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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]


[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=16, j=0, material_length=1, nlen=0]
[L17]  COND TRUE   (j < idBitLength / 8) && (j < material_length)
       VAL         [idBitLength=16, 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=16, 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=16, 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=16, 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 11:32:23,363 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2018-11-23 11:32:23,363 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 11:32:23,363 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 11:32:23,364 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2018-11-23 11:32:23,364 WARN  L170   areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2018-11-23 11:32:23,364 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2018-11-23 11:32:23,365 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 11:32:23,365 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 11:32:23,365 WARN  L170   areAnnotationChecker]: L16 has no Hoare annotation
[2018-11-23 11:32:23,365 WARN  L170   areAnnotationChecker]: L16 has no Hoare annotation
[2018-11-23 11:32:23,366 WARN  L170   areAnnotationChecker]: L4 has no Hoare annotation
[2018-11-23 11:32:23,366 WARN  L170   areAnnotationChecker]: L4 has no Hoare annotation
[2018-11-23 11:32:23,366 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-11-23 11:32:23,366 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2018-11-23 11:32:23,367 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 11:32:23,367 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 11:32:23,367 WARN  L170   areAnnotationChecker]: L17-2 has no Hoare annotation
[2018-11-23 11:32:23,367 WARN  L170   areAnnotationChecker]: L5 has no Hoare annotation
[2018-11-23 11:32:23,368 WARN  L170   areAnnotationChecker]: L5 has no Hoare annotation
[2018-11-23 11:32:23,368 WARN  L170   areAnnotationChecker]: L4-2 has no Hoare annotation
[2018-11-23 11:32:23,368 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2018-11-23 11:32:23,368 WARN  L170   areAnnotationChecker]: L17-3 has no Hoare annotation
[2018-11-23 11:32:23,369 WARN  L170   areAnnotationChecker]: L18 has no Hoare annotation
[2018-11-23 11:32:23,369 WARN  L170   areAnnotationChecker]: L18 has no Hoare annotation
[2018-11-23 11:32:23,369 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 11:32:23,370 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 11:32:23,370 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 11:32:23,370 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2018-11-23 11:32:23,370 WARN  L170   areAnnotationChecker]: L18-1 has no Hoare annotation
[2018-11-23 11:32:23,371 WARN  L170   areAnnotationChecker]: L18-1 has no Hoare annotation
[2018-11-23 11:32:23,371 WARN  L170   areAnnotationChecker]: L19 has no Hoare annotation
[2018-11-23 11:32:23,371 WARN  L170   areAnnotationChecker]: L19 has no Hoare annotation
[2018-11-23 11:32:23,371 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 11:32:23,371 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 11:32:23,372 WARN  L170   areAnnotationChecker]: L21 has no Hoare annotation
[2018-11-23 11:32:23,372 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 11:32:23,375 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:23 BoogieIcfgContainer
[2018-11-23 11:32:23,376 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 11:32:23,376 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 11:32:23,376 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 11:32:23,377 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 11:32:23,378 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:18" (3/4) ...
[2018-11-23 11:32:23,381 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;~nlen~0 := #t~nondet1;havoc #t~nondet1;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;~material_length~0 := #t~nondet3;havoc #t~nondet3;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]        assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));~j~0 := 0bv32;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #44#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #46#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume !(0bv32 == ~cond);
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]        assume true;
     VAL   [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)]
[?]  RET   #48#return;
     VAL   [main_~idBitLength~0=(_ bv16 32), main_~j~0=(_ bv0 32), main_~material_length~0=(_ bv1 32), main_~nlen~0=(_ bv0 32)]
[?]  CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
     VAL   [|__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        ~cond := #in~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        assume 0bv32 == ~cond;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]
[?]        assume !false;
     VAL   [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)]


[?]        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]            ~nlen~0 := #t~nondet1;
[L13]            havoc #t~nondet1;
[L14]            ~idBitLength~0 := #t~nondet2;
[L14]            havoc #t~nondet2;
[L15]            ~material_length~0 := #t~nondet3;
[L15]            havoc #t~nondet3;
           VAL   [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]            assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));
[L17]            ~j~0 := 0bv32;
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET   call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=0bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L4-L6]          assume 0bv32 == ~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L5]             assert false;
           VAL   [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]            ~nlen~0 := #t~nondet1;
[L13]            havoc #t~nondet1;
[L14]            ~idBitLength~0 := #t~nondet2;
[L14]            havoc #t~nondet2;
[L15]            ~material_length~0 := #t~nondet3;
[L15]            havoc #t~nondet3;
           VAL   [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]            assume !!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32));
[L17]            ~j~0 := 0bv32;
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]        assume !!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL  call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET   call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL  call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [#in~cond=1bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L4-L6]          assume !(0bv32 == ~cond);
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L3-L8]          ensures true;
           VAL   [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET   call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL   [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL  call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL   [#in~cond=0bv32]
[L3-L8]          ~cond := #in~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L4-L6]          assume 0bv32 == ~cond;
           VAL   [#in~cond=0bv32, ~cond=0bv32]
[L5]             assert false;
           VAL   [#in~cond=0bv32, ~cond=0bv32]


[?]        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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]


[?]        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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]

-----
-----
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]                  ~nlen~0 := #t~nondet1;
[L13]                  havoc #t~nondet1;
[L14]                  ~idBitLength~0 := #t~nondet2;
[L14]                  havoc #t~nondet2;
[L15]                  ~material_length~0 := #t~nondet3;
[L15]                  havoc #t~nondet3;
           VAL         [~idBitLength~0=16bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L16]      COND FALSE  !(!(~nlen~0 == ~bvsdiv32(~idBitLength~0, 32bv32)))
[L17]                  ~j~0 := 0bv32;
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L17-L22]  COND FALSE  !(!(~bvslt32(~j~0, ~bvsdiv32(~idBitLength~0, 8bv32)) && ~bvslt32(~j~0, ~material_length~0)))
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L18]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L18]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~j~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L19]      CALL        call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L19]      RET         call __VERIFIER_assert((if ~bvslt32(~j~0, ~material_length~0) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L20]      CALL        call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [#in~cond=1bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L4]       COND FALSE  !(0bv32 == ~cond)
           VAL         [#in~cond=1bv32, ~cond=1bv32]
[L20]      RET         call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsdiv32(~j~0, 4bv32)) then 1bv32 else 0bv32));
           VAL         [~idBitLength~0=16bv32, ~j~0=0bv32, ~material_length~0=1bv32, ~nlen~0=0bv32]
[L21]      CALL        call __VERIFIER_assert((if ~bvslt32(~bvsdiv32(~j~0, 4bv32), ~nlen~0) then 1bv32 else 0bv32));
           VAL         [#in~cond=0bv32]
[L3-L8]                ~cond := #in~cond;
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L4]       COND TRUE   0bv32 == ~cond
           VAL         [#in~cond=0bv32, ~cond=0bv32]
[L5]                   assert false;
           VAL         [#in~cond=0bv32, ~cond=0bv32]


[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=16, j=0, material_length=1, nlen=0]
[L17]  COND TRUE   (j < idBitLength / 8) && (j < material_length)
       VAL         [idBitLength=16, 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=16, 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=16, 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=16, 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 11:32:23,480 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 11:32:23,481 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 11:32:23,482 INFO  L168              Benchmark]: Toolchain (without parser) took 5719.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -586.9 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB.
[2018-11-23 11:32:23,484 INFO  L168              Benchmark]: CDTParser took 0.24 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 11:32:23,485 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 373.20 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 11:32:23,486 INFO  L168              Benchmark]: Boogie Procedure Inliner took 28.43 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 11:32:23,486 INFO  L168              Benchmark]: Boogie Preprocessor took 43.95 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 11:32:23,487 INFO  L168              Benchmark]: RCFGBuilder took 670.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB.
[2018-11-23 11:32:23,488 INFO  L168              Benchmark]: TraceAbstraction took 4490.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 157.2 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB.
[2018-11-23 11:32:23,489 INFO  L168              Benchmark]: Witness Printer took 104.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB.
[2018-11-23 11:32:23,494 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.24 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 373.20 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 28.43 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 43.95 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 670.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 4490.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 157.2 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB.
 * Witness Printer took 104.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 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=16, j=0, material_length=1, nlen=0]
[L17]  COND TRUE   (j < idBitLength / 8) && (j < material_length)
       VAL         [idBitLength=16, 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=16, 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=16, 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=16, 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, 4.4s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 13 SDslu, 113 SDs, 0 SdLazy, 51 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 4 NumberOfNonLiveVariables, 53 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...