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/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:29,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:29,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:29,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:29,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:29,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:29,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:29,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:29,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:29,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:29,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:29,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:29,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:29,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:29,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:29,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:29,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:29,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:29,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:29,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:29,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:29,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:29,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:29,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:29,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:29,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:29,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:29,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:29,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:29,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:29,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:29,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:29,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:29,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:29,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:29,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:29,205 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:26:29,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:29,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:29,223 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:29,223 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:29,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:29,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:29,224 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:29,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:29,224 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:29,225 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:29,226 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:29,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:29,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:29,226 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:29,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:29,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:29,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:29,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:29,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:29,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:29,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:29,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:29,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:29,228 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:29,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:29,229 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:29,229 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:29,229 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:29,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:29,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:29,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:29,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:29,293 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:29,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 11:26:29,359 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306707e29/1600b74f3b754d1bacd2efa0cd8264fc/FLAG3162f2471 [2018-11-23 11:26:29,809 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:29,810 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 11:26:29,817 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306707e29/1600b74f3b754d1bacd2efa0cd8264fc/FLAG3162f2471 [2018-11-23 11:26:30,162 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306707e29/1600b74f3b754d1bacd2efa0cd8264fc [2018-11-23 11:26:30,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:30,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:30,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:30,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:30,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:30,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f821127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30, skipping insertion in model container [2018-11-23 11:26:30,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:30,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:30,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:30,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:30,629 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:30,669 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:30,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30 WrapperNode [2018-11-23 11:26:30,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:30,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:30,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:30,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:30,679 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:26:30" (1/1) ... [2018-11-23 11:26:30,692 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:26:30" (1/1) ... [2018-11-23 11:26:30,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:30,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:30,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:30,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:30,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (1/1) ... [2018-11-23 11:26:30,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:30,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:30,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:30,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:30,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (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:26:30,915 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 11:26:30,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:26:30,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:30,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:30,916 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-23 11:26:30,916 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-23 11:26:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:26:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:30,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:30,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:26:30,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:26:32,052 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:32,053 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:26:32,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:32 BoogieIcfgContainer [2018-11-23 11:26:32,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:32,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:32,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:32,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:32,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:30" (1/3) ... [2018-11-23 11:26:32,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd959d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:32, skipping insertion in model container [2018-11-23 11:26:32,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:30" (2/3) ... [2018-11-23 11:26:32,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd959d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:32, skipping insertion in model container [2018-11-23 11:26:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:32" (3/3) ... [2018-11-23 11:26:32,063 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 11:26:32,074 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:32,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:32,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:32,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:32,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:32,138 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:32,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:32,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:32,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:32,138 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:32,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:32,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:26:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:26:32,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:32,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:32,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1305434758, now seen corresponding path program 1 times [2018-11-23 11:26:32,182 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:32,182 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:26:32,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:32,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:32,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:26:32,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:26:32,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:26:32,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #143#return; {53#true} is VALID [2018-11-23 11:26:32,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret22 := main(); {53#true} is VALID [2018-11-23 11:26:32,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);~i~1 := 0bv32; {53#true} is VALID [2018-11-23 11:26:32,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#true} assume !~bvslt32(~i~1, 8bv32); {53#true} is VALID [2018-11-23 11:26:32,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {53#true} is VALID [2018-11-23 11:26:32,405 INFO L256 TraceCheckUtils]: 8: Hoare triple {53#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {53#true} is VALID [2018-11-23 11:26:32,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {53#true} is VALID [2018-11-23 11:26:32,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {53#true} is VALID [2018-11-23 11:26:32,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {53#true} is VALID [2018-11-23 11:26:32,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#true} assume #t~switch3; {53#true} is VALID [2018-11-23 11:26:32,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 11:26:32,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {54#false} is VALID [2018-11-23 11:26:32,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {54#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {54#false} is VALID [2018-11-23 11:26:32,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {54#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {54#false} is VALID [2018-11-23 11:26:32,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#false} assume !true; {54#false} is VALID [2018-11-23 11:26:32,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {54#false} is VALID [2018-11-23 11:26:32,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {54#false} is VALID [2018-11-23 11:26:32,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {54#false} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {54#false} is VALID [2018-11-23 11:26:32,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {54#false} assume ~bvsle32(~start~0, ~j~0); {54#false} is VALID [2018-11-23 11:26:32,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {54#false} assume !~bvsge32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {54#false} is VALID [2018-11-23 11:26:32,426 INFO L256 TraceCheckUtils]: 23: Hoare triple {54#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {54#false} is VALID [2018-11-23 11:26:32,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {54#false} ~cond := #in~cond; {54#false} is VALID [2018-11-23 11:26:32,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {54#false} assume 0bv32 == ~cond; {54#false} is VALID [2018-11-23 11:26:32,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:26:32,433 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:26:32,433 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:26:32,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:26:32,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:32,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:26:32,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:32,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:26:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:26:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:32,641 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:26:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:32,848 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2018-11-23 11:26:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:26:32,848 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:26:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2018-11-23 11:26:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2018-11-23 11:26:32,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2018-11-23 11:26:33,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:33,807 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:26:33,811 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:26:33,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:26:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:26:33,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:33,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:26:33,866 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:26:33,866 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:26:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:33,872 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 11:26:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-23 11:26:33,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:33,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:33,874 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:26:33,874 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:26:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:33,881 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 11:26:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-23 11:26:33,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:33,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:33,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:33,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:26:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-11-23 11:26:33,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 27 [2018-11-23 11:26:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:33,892 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-23 11:26:33,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:26:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-23 11:26:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:26:33,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:33,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:33,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:33,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1993805327, now seen corresponding path program 1 times [2018-11-23 11:26:33,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:33,906 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:26:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:33,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:34,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-23 11:26:34,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {384#true} is VALID [2018-11-23 11:26:34,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-23 11:26:34,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {384#true} {384#true} #143#return; {384#true} is VALID [2018-11-23 11:26:34,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {384#true} call #t~ret22 := main(); {384#true} is VALID [2018-11-23 11:26:34,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {384#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);~i~1 := 0bv32; {384#true} is VALID [2018-11-23 11:26:34,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {384#true} assume !~bvslt32(~i~1, 8bv32); {384#true} is VALID [2018-11-23 11:26:34,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#true} call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {384#true} is VALID [2018-11-23 11:26:34,089 INFO L256 TraceCheckUtils]: 8: Hoare triple {384#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {384#true} is VALID [2018-11-23 11:26:34,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {384#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {384#true} is VALID [2018-11-23 11:26:34,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {384#true} is VALID [2018-11-23 11:26:34,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {384#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {384#true} is VALID [2018-11-23 11:26:34,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {384#true} assume #t~switch3; {384#true} is VALID [2018-11-23 11:26:34,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {384#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {384#true} is VALID [2018-11-23 11:26:34,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {384#true} assume #t~short6; {431#|parse_expression_list_#t~short6|} is VALID [2018-11-23 11:26:34,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {431#|parse_expression_list_#t~short6|} assume !#t~short6;havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {385#false} is VALID [2018-11-23 11:26:34,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {385#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {385#false} is VALID [2018-11-23 11:26:34,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {385#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {385#false} is VALID [2018-11-23 11:26:34,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {385#false} is VALID [2018-11-23 11:26:34,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} #t~short13 := ~bvslt32(0bv32, ~j~0); {385#false} is VALID [2018-11-23 11:26:34,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#false} assume !#t~short13; {385#false} is VALID [2018-11-23 11:26:34,120 INFO L273 TraceCheckUtils]: 21: Hoare triple {385#false} assume !#t~short13;havoc #t~mem11;havoc #t~short12;havoc #t~short13;havoc #t~mem10; {385#false} is VALID [2018-11-23 11:26:34,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {385#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {385#false} is VALID [2018-11-23 11:26:34,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {385#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {385#false} is VALID [2018-11-23 11:26:34,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {385#false} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {385#false} is VALID [2018-11-23 11:26:34,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {385#false} assume ~bvsle32(~start~0, ~j~0); {385#false} is VALID [2018-11-23 11:26:34,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {385#false} assume !~bvsge32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {385#false} is VALID [2018-11-23 11:26:34,122 INFO L256 TraceCheckUtils]: 27: Hoare triple {385#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {385#false} is VALID [2018-11-23 11:26:34,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-23 11:26:34,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {385#false} assume 0bv32 == ~cond; {385#false} is VALID [2018-11-23 11:26:34,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-23 11:26:34,125 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:26:34,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:34,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:34,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:26:34,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:26:34,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:34,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:26:34,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:34,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:26:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:26:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:34,228 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2018-11-23 11:26:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:34,510 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 11:26:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:26:34,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:26:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 11:26:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 11:26:34,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 11:26:34,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:34,989 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:26:34,989 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:26:34,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:26:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:26:35,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:35,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:26:35,006 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:26:35,006 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:26:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:35,009 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 11:26:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:26:35,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:35,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:35,011 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:26:35,011 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:26:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:35,014 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 11:26:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:26:35,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:35,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:35,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:35,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:26:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 11:26:35,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 31 [2018-11-23 11:26:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:35,020 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 11:26:35,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:26:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:26:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:26:35,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:35,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:35,022 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:35,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash 712814067, now seen corresponding path program 1 times [2018-11-23 11:26:35,025 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:35,025 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:26:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:35,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:35,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:26:35,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {710#true} is VALID [2018-11-23 11:26:35,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:26:35,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #143#return; {710#true} is VALID [2018-11-23 11:26:35,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret22 := main(); {710#true} is VALID [2018-11-23 11:26:35,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);~i~1 := 0bv32; {710#true} is VALID [2018-11-23 11:26:35,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {710#true} assume !~bvslt32(~i~1, 8bv32); {710#true} is VALID [2018-11-23 11:26:35,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {710#true} call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {710#true} is VALID [2018-11-23 11:26:35,245 INFO L256 TraceCheckUtils]: 8: Hoare triple {710#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {710#true} is VALID [2018-11-23 11:26:35,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {710#true} is VALID [2018-11-23 11:26:35,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {710#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {710#true} is VALID [2018-11-23 11:26:35,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {710#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {710#true} is VALID [2018-11-23 11:26:35,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {710#true} assume #t~switch3; {710#true} is VALID [2018-11-23 11:26:35,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {710#true} is VALID [2018-11-23 11:26:35,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {710#true} is VALID [2018-11-23 11:26:35,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#true} assume !#t~short6;havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {710#true} is VALID [2018-11-23 11:26:35,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {710#true} is VALID [2018-11-23 11:26:35,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {710#true} is VALID [2018-11-23 11:26:35,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {710#true} is VALID [2018-11-23 11:26:35,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {710#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {772#(or (and |parse_expression_list_#t~short13| (bvslt (_ bv0 32) parse_expression_list_~j~0)) (and (not |parse_expression_list_#t~short13|) (not (bvslt (_ bv0 32) parse_expression_list_~j~0))))} is VALID [2018-11-23 11:26:35,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {772#(or (and |parse_expression_list_#t~short13| (bvslt (_ bv0 32) parse_expression_list_~j~0)) (and (not |parse_expression_list_#t~short13|) (not (bvslt (_ bv0 32) parse_expression_list_~j~0))))} assume !#t~short13; {776#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:35,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~mem11;havoc #t~short12;havoc #t~short13;havoc #t~mem10; {776#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:35,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {783#(not |parse_expression_list_#t~short16|)} is VALID [2018-11-23 11:26:35,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {783#(not |parse_expression_list_#t~short16|)} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {711#false} is VALID [2018-11-23 11:26:35,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume #t~short16;havoc #t~short16;havoc #t~mem15;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {711#false} is VALID [2018-11-23 11:26:35,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {711#false} assume ~bvsle32(~start~0, ~j~0); {711#false} is VALID [2018-11-23 11:26:35,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {711#false} assume !~bvsge32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {711#false} is VALID [2018-11-23 11:26:35,260 INFO L256 TraceCheckUtils]: 27: Hoare triple {711#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {711#false} is VALID [2018-11-23 11:26:35,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 11:26:35,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {711#false} assume 0bv32 == ~cond; {711#false} is VALID [2018-11-23 11:26:35,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:26:35,263 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:26:35,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:35,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:35,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:26:35,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:26:35,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:35,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:26:35,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:35,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:26:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:26:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:26:35,387 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 5 states. [2018-11-23 11:26:35,788 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-23 11:26:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,217 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2018-11-23 11:26:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:26:36,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:26:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2018-11-23 11:26:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2018-11-23 11:26:36,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 121 transitions. [2018-11-23 11:26:36,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:36,503 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:26:36,504 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:26:36,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:26:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-11-23 11:26:36,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:36,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 47 states. [2018-11-23 11:26:36,533 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 47 states. [2018-11-23 11:26:36,533 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 47 states. [2018-11-23 11:26:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,539 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 11:26:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-11-23 11:26:36,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:36,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:36,540 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 65 states. [2018-11-23 11:26:36,540 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 65 states. [2018-11-23 11:26:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,545 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 11:26:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-11-23 11:26:36,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:36,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:36,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:36,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:26:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 11:26:36,551 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2018-11-23 11:26:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:36,551 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 11:26:36,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:26:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 11:26:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:26:36,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:36,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:36,554 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1678474803, now seen corresponding path program 1 times [2018-11-23 11:26:36,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:36,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:36,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:36,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 11:26:36,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1116#true} is VALID [2018-11-23 11:26:36,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 11:26:36,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #143#return; {1116#true} is VALID [2018-11-23 11:26:36,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret22 := main(); {1116#true} is VALID [2018-11-23 11:26:36,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1116#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);~i~1 := 0bv32; {1116#true} is VALID [2018-11-23 11:26:36,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#true} assume !~bvslt32(~i~1, 8bv32); {1116#true} is VALID [2018-11-23 11:26:36,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#true} call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {1116#true} is VALID [2018-11-23 11:26:36,849 INFO L256 TraceCheckUtils]: 8: Hoare triple {1116#true} call #t~ret21 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1116#true} is VALID [2018-11-23 11:26:36,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {1116#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {1116#true} is VALID [2018-11-23 11:26:36,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {1116#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {1116#true} is VALID [2018-11-23 11:26:36,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {1116#true} is VALID [2018-11-23 11:26:36,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#true} assume #t~switch3; {1116#true} is VALID [2018-11-23 11:26:36,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {1116#true} is VALID [2018-11-23 11:26:36,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {1116#true} is VALID [2018-11-23 11:26:36,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#true} assume !#t~short6;havoc #t~mem5;havoc #t~short6;havoc #t~mem4; {1116#true} is VALID [2018-11-23 11:26:36,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {1116#true} is VALID [2018-11-23 11:26:36,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1116#true} is VALID [2018-11-23 11:26:36,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {1116#true} is VALID [2018-11-23 11:26:36,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {1116#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {1116#true} is VALID [2018-11-23 11:26:36,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {1116#true} assume !#t~short13; {1116#true} is VALID [2018-11-23 11:26:36,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {1116#true} assume !#t~short13;havoc #t~mem11;havoc #t~short12;havoc #t~short13;havoc #t~mem10; {1116#true} is VALID [2018-11-23 11:26:36,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#true} #t~short16 := ~bvslt32(0bv32, ~j~0); {1116#true} is VALID [2018-11-23 11:26:36,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#true} assume !#t~short16; {1116#true} is VALID [2018-11-23 11:26:36,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {1116#true} assume !#t~short16;havoc #t~short16;havoc #t~mem15; {1116#true} is VALID [2018-11-23 11:26:36,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {1116#true} assume ~bvsle32(~start~0, ~j~0); {1116#true} is VALID [2018-11-23 11:26:36,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !~bvsge32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {1199#(not (bvsge (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32)))} is VALID [2018-11-23 11:26:36,869 INFO L256 TraceCheckUtils]: 27: Hoare triple {1199#(not (bvsge (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32)))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {1203#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:36,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {1203#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1207#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:36,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {1207#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1117#false} is VALID [2018-11-23 11:26:36,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 11:26:36,876 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:26:36,876 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:36,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:36,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:26:36,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:26:36,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:36,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:26:36,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:26:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:26:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:26:36,928 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 5 states. [2018-11-23 11:26:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:37,821 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2018-11-23 11:26:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:26:37,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:26:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 11:26:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 11:26:37,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-23 11:26:37,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:37,974 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:26:37,974 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:26:37,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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:26:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:26:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:26:37,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:37,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:37,976 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:37,976 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:37,977 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:37,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:37,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:37,978 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:37,978 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:37,978 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:37,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:37,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:37,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:37,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:26:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:26:37,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 11:26:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:37,980 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:26:37,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:26:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:37,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:37,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:26:38,381 INFO L448 ceAbstractionStarter]: For program point L60-1(line 60) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L448 ceAbstractionStarter]: For program point L60-4(line 60) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L448 ceAbstractionStarter]: For program point L60-6(line 60) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-23 11:26:38,382 INFO L451 ceAbstractionStarter]: At program point L60-8(line 60) the Hoare annotation is: true [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L60-9(line 60) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L61-2(line 61) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L61-4(lines 55 73) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L57-3(line 57) no Hoare annotation was computed. [2018-11-23 11:26:38,383 INFO L451 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: true [2018-11-23 11:26:38,383 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 53 74) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point L57-6(line 57) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point L53-2(lines 53 74) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L451 ceAbstractionStarter]: At program point L53-4(lines 53 74) the Hoare annotation is: true [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point L53-5(lines 53 74) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point parse_expression_listFINAL(lines 48 76) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-23 11:26:38,384 INFO L451 ceAbstractionStarter]: At program point parse_expression_listENTRY(lines 48 76) the Hoare annotation is: true [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point L58-2(line 58) no Hoare annotation was computed. [2018-11-23 11:26:38,385 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (not (bvsge (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))) [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 65) no Hoare annotation was computed. [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point parse_expression_listEXIT(lines 48 76) no Hoare annotation was computed. [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 73) no Hoare annotation was computed. [2018-11-23 11:26:38,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:38,386 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:38,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:38,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:38,386 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:26:38,386 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:38,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:38,386 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 77 88) the Hoare annotation is: true [2018-11-23 11:26:38,387 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 77 88) no Hoare annotation was computed. [2018-11-23 11:26:38,387 INFO L451 ceAbstractionStarter]: At program point L86(line 86) the Hoare annotation is: true [2018-11-23 11:26:38,387 INFO L448 ceAbstractionStarter]: For program point L86-1(line 86) no Hoare annotation was computed. [2018-11-23 11:26:38,387 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 81 83) no Hoare annotation was computed. [2018-11-23 11:26:38,387 INFO L451 ceAbstractionStarter]: At program point L81-3(lines 81 83) the Hoare annotation is: true [2018-11-23 11:26:38,387 INFO L448 ceAbstractionStarter]: For program point L81-4(lines 81 83) no Hoare annotation was computed. [2018-11-23 11:26:38,387 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 77 88) no Hoare annotation was computed. [2018-11-23 11:26:38,388 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 11:26:38,388 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 11:26:38,388 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:26:38,388 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 11:26:38,388 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 11:26:38,388 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:26:38,390 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 11:26:38,390 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:26:38,390 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:38,391 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L53-5 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L81-4 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:26:38,392 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L53-5 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L57-6 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 11:26:38,393 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L57-6 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 11:26:38,394 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L60-9 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L60-9 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 11:26:38,395 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2018-11-23 11:26:38,396 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2018-11-23 11:26:38,397 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-23 11:26:38,398 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-23 11:26:38,398 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 11:26:38,398 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:26:38,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:26:38 BoogieIcfgContainer [2018-11-23 11:26:38,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:26:38,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:26:38,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:26:38,405 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:26:38,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:32" (3/4) ... [2018-11-23 11:26:38,409 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:26:38,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure parse_expression_list [2018-11-23 11:26:38,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:26:38,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:26:38,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:26:38,425 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-23 11:26:38,426 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 11:26:38,426 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:26:38,503 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:26:38,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:26:38,505 INFO L168 Benchmark]: Toolchain (without parser) took 8327.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -338.9 MB). Peak memory consumption was 365.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:38,506 INFO L168 Benchmark]: CDTParser took 0.22 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:26:38,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.78 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:26:38,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.07 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:26:38,508 INFO L168 Benchmark]: Boogie Preprocessor took 145.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -750.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:38,509 INFO L168 Benchmark]: RCFGBuilder took 1206.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:38,509 INFO L168 Benchmark]: TraceAbstraction took 6349.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.1 MB). Peak memory consumption was 363.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:38,510 INFO L168 Benchmark]: Witness Printer took 99.50 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:38,513 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.22 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. * CACSL2BoogieTranslator took 490.78 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 30.07 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 145.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -750.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1206.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6349.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.1 MB). Peak memory consumption was 363.1 MB. Max. memory is 7.1 GB. * Witness Printer took 99.50 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. SAFE Result, 6.2s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 45 SDslu, 269 SDs, 0 SdLazy, 93 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, 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, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 20 PreInvPairs, 27 NumberOfFragments, 19 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 4396 SizeOfPredicates, 4 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...