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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:42:55,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:42:55,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:42:55,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:42:55,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:42:55,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:42:55,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:42:55,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:42:55,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:42:55,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:42:55,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:42:55,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:42:55,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:42:55,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:42:55,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:42:55,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:42:55,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:42:55,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:42:55,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:42:55,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:42:55,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:42:55,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:42:55,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:42:55,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:42:55,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:42:55,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:42:55,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:42:55,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:42:55,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:42:55,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:42:55,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:42:55,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:42:55,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:42:55,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:42:55,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:42:55,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:42:55,247 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-14 16:42:55,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:42:55,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:42:55,277 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:42:55,277 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:42:55,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:42:55,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:42:55,279 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:42:55,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:42:55,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:42:55,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:42:55,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:42:55,280 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:42:55,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:42:55,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:42:55,282 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:42:55,282 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:42:55,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:42:55,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:42:55,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:42:55,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:42:55,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:42:55,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:42:55,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:42:55,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:42:55,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:42:55,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:42:55,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:42:55,285 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:42:55,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:42:55,286 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:42:55,286 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:42:55,286 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:42:55,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:42:55,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:42:55,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:42:55,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:42:55,358 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:42:55,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:42:55,427 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604dcc84b/6197bf5675644a6f85e8e354ca6fa3af/FLAG307925c69 [2018-11-14 16:42:55,960 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:42:55,964 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:42:55,977 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604dcc84b/6197bf5675644a6f85e8e354ca6fa3af/FLAG307925c69 [2018-11-14 16:42:55,999 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604dcc84b/6197bf5675644a6f85e8e354ca6fa3af [2018-11-14 16:42:56,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:42:56,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:42:56,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:42:56,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:42:56,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:42:56,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2d08f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56, skipping insertion in model container [2018-11-14 16:42:56,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:42:56,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:42:56,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:42:56,426 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:42:56,505 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:42:56,529 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:42:56,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56 WrapperNode [2018-11-14 16:42:56,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:42:56,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:42:56,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:42:56,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:42:56,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (1/1) ... [2018-11-14 16:42:56,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:42:56,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:42:56,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:42:56,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:42:56,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (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-14 16:42:56,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:42:56,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:42:56,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:42:56,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:42:56,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:42:57,810 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:42:57,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:57 BoogieIcfgContainer [2018-11-14 16:42:57,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:42:57,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:42:57,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:42:57,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:42:57,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:42:56" (1/3) ... [2018-11-14 16:42:57,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae4ef6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:57, skipping insertion in model container [2018-11-14 16:42:57,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:56" (2/3) ... [2018-11-14 16:42:57,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae4ef6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:57, skipping insertion in model container [2018-11-14 16:42:57,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:57" (3/3) ... [2018-11-14 16:42:57,819 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:42:57,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:42:57,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 16:42:57,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 16:42:57,882 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:42:57,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:42:57,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:42:57,884 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:42:57,884 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:42:57,884 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:42:57,884 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:42:57,884 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:42:57,885 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:42:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-14 16:42:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:42:57,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:57,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:57,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:57,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-11-14 16:42:57,929 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:57,930 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-14 16:42:57,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:42:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:58,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:42:58,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-14 16:42:58,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {68#true} is VALID [2018-11-14 16:42:58,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 16:42:58,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #139#return; {68#true} is VALID [2018-11-14 16:42:58,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret4 := main(); {68#true} is VALID [2018-11-14 16:42:58,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {68#true} is VALID [2018-11-14 16:42:58,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {68#true} is VALID [2018-11-14 16:42:58,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {68#true} is VALID [2018-11-14 16:42:58,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~bvslt32(~main__i~0, ~main__len~0); {68#true} is VALID [2018-11-14 16:42:58,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~bvslt32(~main__j~0, ~main__limit~0); {68#true} is VALID [2018-11-14 16:42:58,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {68#true} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {103#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {103#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {69#false} is VALID [2018-11-14 16:42:58,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-14 16:42:58,219 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-14 16:42:58,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:42:58,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:42:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:42:58,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:42:58,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:42:58,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:42:58,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:58,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:42:58,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:42:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:42:58,324 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-11-14 16:42:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:58,836 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-11-14 16:42:58,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:42:58,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:42:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:42:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:42:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-14 16:42:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:42:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-14 16:42:58,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-14 16:42:59,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:59,503 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:42:59,503 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 16:42:59,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-14 16:42:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 16:42:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-14 16:42:59,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:42:59,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2018-11-14 16:42:59,596 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2018-11-14 16:42:59,596 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2018-11-14 16:42:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:59,604 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-14 16:42:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-14 16:42:59,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:59,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:59,606 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2018-11-14 16:42:59,606 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2018-11-14 16:42:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:59,617 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-14 16:42:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-14 16:42:59,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:59,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:59,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:42:59,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:42:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:42:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-14 16:42:59,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-11-14 16:42:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:42:59,627 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-14 16:42:59,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:42:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-14 16:42:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:42:59,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:59,629 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:59,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:59,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-11-14 16:42:59,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:59,631 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-14 16:42:59,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:42:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:59,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:42:59,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-14 16:42:59,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {425#true} is VALID [2018-11-14 16:42:59,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-14 16:42:59,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #139#return; {425#true} is VALID [2018-11-14 16:42:59,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret4 := main(); {425#true} is VALID [2018-11-14 16:42:59,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2018-11-14 16:42:59,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {425#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {425#true} is VALID [2018-11-14 16:42:59,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {451#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:42:59,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#(bvslt main_~main__i~0 main_~main__len~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {451#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:42:59,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#(bvslt main_~main__i~0 main_~main__len~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {451#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:42:59,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#(bvslt main_~main__i~0 main_~main__len~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {451#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:42:59,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#(bvslt main_~main__i~0 main_~main__len~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {464#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:59,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {464#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~2 == 0bv32; {426#false} is VALID [2018-11-14 16:42:59,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-14 16:42:59,798 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-14 16:42:59,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:42:59,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:42:59,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:42:59,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:42:59,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:42:59,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:42:59,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:59,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:42:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:42:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:42:59,832 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-14 16:43:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:00,594 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-14 16:43:00,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:00,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:43:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-14 16:43:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-14 16:43:00,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 168 transitions. [2018-11-14 16:43:00,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:00,993 INFO L225 Difference]: With dead ends: 153 [2018-11-14 16:43:00,993 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 16:43:00,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 16:43:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-11-14 16:43:01,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:01,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2018-11-14 16:43:01,041 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2018-11-14 16:43:01,042 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2018-11-14 16:43:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:01,047 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-14 16:43:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-14 16:43:01,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:01,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:01,049 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2018-11-14 16:43:01,050 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2018-11-14 16:43:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:01,055 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-14 16:43:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-14 16:43:01,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:01,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:01,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:43:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-14 16:43:01,061 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-11-14 16:43:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:01,062 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-14 16:43:01,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 16:43:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:43:01,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:01,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:01,067 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:01,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-11-14 16:43:01,067 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:01,068 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-14 16:43:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:01,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:01,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {910#true} call ULTIMATE.init(); {910#true} is VALID [2018-11-14 16:43:01,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {910#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {910#true} is VALID [2018-11-14 16:43:01,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {910#true} assume true; {910#true} is VALID [2018-11-14 16:43:01,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {910#true} {910#true} #139#return; {910#true} is VALID [2018-11-14 16:43:01,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {910#true} call #t~ret4 := main(); {910#true} is VALID [2018-11-14 16:43:01,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {910#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {910#true} is VALID [2018-11-14 16:43:01,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {910#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {933#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:01,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {933#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {933#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:01,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {933#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {933#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:01,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {933#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {933#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:01,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {933#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {933#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:01,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {933#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {949#(= (_ bv1 32) main_~__VERIFIER_assert__cond~1)} is VALID [2018-11-14 16:43:01,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {949#(= (_ bv1 32) main_~__VERIFIER_assert__cond~1)} assume ~__VERIFIER_assert__cond~1 == 0bv32; {911#false} is VALID [2018-11-14 16:43:01,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {911#false} assume !false; {911#false} is VALID [2018-11-14 16:43:01,206 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-14 16:43:01,206 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:01,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:01,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:43:01,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:01,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:01,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:01,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:01,237 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2018-11-14 16:43:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:01,879 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-11-14 16:43:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:01,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:43:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-14 16:43:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-14 16:43:01,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2018-11-14 16:43:02,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:02,178 INFO L225 Difference]: With dead ends: 136 [2018-11-14 16:43:02,178 INFO L226 Difference]: Without dead ends: 134 [2018-11-14 16:43:02,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-14 16:43:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 64. [2018-11-14 16:43:02,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:02,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 64 states. [2018-11-14 16:43:02,222 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 64 states. [2018-11-14 16:43:02,223 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 64 states. [2018-11-14 16:43:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:02,229 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-11-14 16:43:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-14 16:43:02,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:02,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:02,231 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 134 states. [2018-11-14 16:43:02,231 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 134 states. [2018-11-14 16:43:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:02,238 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-11-14 16:43:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-14 16:43:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:02,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:02,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:02,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 16:43:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-14 16:43:02,243 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 14 [2018-11-14 16:43:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:02,244 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-14 16:43:02,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 16:43:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:43:02,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:02,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:02,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:02,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-11-14 16:43:02,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:02,247 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-14 16:43:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:02,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {1451#true} call ULTIMATE.init(); {1451#true} is VALID [2018-11-14 16:43:02,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {1451#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {1451#true} is VALID [2018-11-14 16:43:02,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {1451#true} assume true; {1451#true} is VALID [2018-11-14 16:43:02,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1451#true} {1451#true} #139#return; {1451#true} is VALID [2018-11-14 16:43:02,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {1451#true} call #t~ret4 := main(); {1451#true} is VALID [2018-11-14 16:43:02,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {1451#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1451#true} is VALID [2018-11-14 16:43:02,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {1451#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1474#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:02,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {1474#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1493#(= (_ bv1 32) main_~__VERIFIER_assert__cond~3)} is VALID [2018-11-14 16:43:02,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {1493#(= (_ bv1 32) main_~__VERIFIER_assert__cond~3)} assume ~__VERIFIER_assert__cond~3 == 0bv32; {1452#false} is VALID [2018-11-14 16:43:02,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {1452#false} assume !false; {1452#false} is VALID [2018-11-14 16:43:02,417 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-14 16:43:02,418 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:02,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:02,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:02,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:43:02,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:02,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:02,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:02,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:02,463 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2018-11-14 16:43:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:03,001 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-11-14 16:43:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:03,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:43:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2018-11-14 16:43:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2018-11-14 16:43:03,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 139 transitions. [2018-11-14 16:43:03,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:03,212 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:43:03,212 INFO L226 Difference]: Without dead ends: 128 [2018-11-14 16:43:03,213 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-14 16:43:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2018-11-14 16:43:03,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:03,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 68 states. [2018-11-14 16:43:03,243 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 68 states. [2018-11-14 16:43:03,243 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 68 states. [2018-11-14 16:43:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:03,248 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-14 16:43:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2018-11-14 16:43:03,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:03,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:03,249 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 128 states. [2018-11-14 16:43:03,249 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 128 states. [2018-11-14 16:43:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:03,255 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-14 16:43:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2018-11-14 16:43:03,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:03,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:03,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:03,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:43:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-14 16:43:03,259 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 15 [2018-11-14 16:43:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:03,259 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-14 16:43:03,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-14 16:43:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:43:03,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:03,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:03,261 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:03,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-11-14 16:43:03,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:03,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:03,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {1981#true} call ULTIMATE.init(); {1981#true} is VALID [2018-11-14 16:43:03,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {1981#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {1981#true} is VALID [2018-11-14 16:43:03,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {1981#true} assume true; {1981#true} is VALID [2018-11-14 16:43:03,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1981#true} {1981#true} #139#return; {1981#true} is VALID [2018-11-14 16:43:03,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {1981#true} call #t~ret4 := main(); {1981#true} is VALID [2018-11-14 16:43:03,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {1981#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1981#true} is VALID [2018-11-14 16:43:03,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {1981#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {2004#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:03,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {2004#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {2008#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:03,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {2008#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {2008#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:03,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {2008#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:03,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:03,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:03,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:03,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {2015#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2028#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:03,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {2028#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {1982#false} is VALID [2018-11-14 16:43:03,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {1982#false} assume !false; {1982#false} is VALID [2018-11-14 16:43:03,491 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-14 16:43:03,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:03,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:03,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:03,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:03,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:03,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:03,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:03,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:03,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:03,525 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-11-14 16:43:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:05,297 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-14 16:43:05,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:43:05,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2018-11-14 16:43:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2018-11-14 16:43:05,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 173 transitions. [2018-11-14 16:43:05,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:05,802 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:43:05,802 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 16:43:05,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:43:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 16:43:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 77. [2018-11-14 16:43:05,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:05,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 77 states. [2018-11-14 16:43:05,853 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 77 states. [2018-11-14 16:43:05,854 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 77 states. [2018-11-14 16:43:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:05,858 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2018-11-14 16:43:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-11-14 16:43:05,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:05,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:05,859 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 168 states. [2018-11-14 16:43:05,859 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 168 states. [2018-11-14 16:43:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:05,864 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2018-11-14 16:43:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-11-14 16:43:05,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:05,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:05,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:05,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:43:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2018-11-14 16:43:05,868 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 16 [2018-11-14 16:43:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:05,868 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2018-11-14 16:43:05,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-11-14 16:43:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:43:05,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:05,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:05,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:05,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-11-14 16:43:05,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:05,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:05,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:05,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:06,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2018-11-14 16:43:06,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {2657#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {2657#true} is VALID [2018-11-14 16:43:06,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 16:43:06,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #139#return; {2657#true} is VALID [2018-11-14 16:43:06,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret4 := main(); {2657#true} is VALID [2018-11-14 16:43:06,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {2657#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2657#true} is VALID [2018-11-14 16:43:06,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {2657#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {2657#true} is VALID [2018-11-14 16:43:06,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {2657#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2683#(bvslt main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 16:43:06,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {2683#(bvslt main_~main__i~0 main_~main__len~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2702#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {2702#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {2658#false} is VALID [2018-11-14 16:43:06,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2018-11-14 16:43:06,095 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-14 16:43:06,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:06,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-14 16:43:06,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:06,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:06,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:06,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:06,118 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 4 states. [2018-11-14 16:43:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,649 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2018-11-14 16:43:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:06,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-14 16:43:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-14 16:43:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-14 16:43:06,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2018-11-14 16:43:06,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:06,839 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:43:06,839 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 16:43:06,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 16:43:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2018-11-14 16:43:06,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:06,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 75 states. [2018-11-14 16:43:06,893 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 75 states. [2018-11-14 16:43:06,893 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 75 states. [2018-11-14 16:43:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,898 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2018-11-14 16:43:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-11-14 16:43:06,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:06,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:06,899 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 108 states. [2018-11-14 16:43:06,899 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 108 states. [2018-11-14 16:43:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,903 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2018-11-14 16:43:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-11-14 16:43:06,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:06,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:06,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:06,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 16:43:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-11-14 16:43:06,906 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 16 [2018-11-14 16:43:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:06,906 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-11-14 16:43:06,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-14 16:43:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:43:06,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:06,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:06,908 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:06,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-11-14 16:43:06,909 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:06,909 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:06,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:06,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:07,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {3143#true} call ULTIMATE.init(); {3143#true} is VALID [2018-11-14 16:43:07,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {3143#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {3143#true} is VALID [2018-11-14 16:43:07,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {3143#true} assume true; {3143#true} is VALID [2018-11-14 16:43:07,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3143#true} {3143#true} #139#return; {3143#true} is VALID [2018-11-14 16:43:07,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {3143#true} call #t~ret4 := main(); {3143#true} is VALID [2018-11-14 16:43:07,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {3143#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3143#true} is VALID [2018-11-14 16:43:07,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {3143#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {3143#true} is VALID [2018-11-14 16:43:07,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {3143#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3169#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:07,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {3169#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3191#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {3191#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {3144#false} is VALID [2018-11-14 16:43:07,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {3144#false} assume !false; {3144#false} is VALID [2018-11-14 16:43:07,256 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-14 16:43:07,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:07,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:07,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:07,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 16:43:07,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:07,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:07,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:07,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:07,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:07,292 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 4 states. [2018-11-14 16:43:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:07,934 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-11-14 16:43:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:07,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 16:43:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2018-11-14 16:43:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2018-11-14 16:43:07,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 167 transitions. [2018-11-14 16:43:08,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:08,186 INFO L225 Difference]: With dead ends: 164 [2018-11-14 16:43:08,186 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 16:43:08,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 16:43:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 76. [2018-11-14 16:43:08,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:08,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 76 states. [2018-11-14 16:43:08,241 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 76 states. [2018-11-14 16:43:08,241 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 76 states. [2018-11-14 16:43:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:08,246 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-11-14 16:43:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-11-14 16:43:08,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:08,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:08,247 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 162 states. [2018-11-14 16:43:08,247 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 162 states. [2018-11-14 16:43:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:08,251 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-11-14 16:43:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-11-14 16:43:08,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:08,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:08,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:08,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 16:43:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-11-14 16:43:08,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 17 [2018-11-14 16:43:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-11-14 16:43:08,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-11-14 16:43:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:43:08,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:08,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:08,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:08,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-11-14 16:43:08,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:08,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:08,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3795#true} is VALID [2018-11-14 16:43:08,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {3795#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {3795#true} is VALID [2018-11-14 16:43:08,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {3795#true} assume true; {3795#true} is VALID [2018-11-14 16:43:08,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3795#true} {3795#true} #139#return; {3795#true} is VALID [2018-11-14 16:43:08,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {3795#true} call #t~ret4 := main(); {3795#true} is VALID [2018-11-14 16:43:08,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {3795#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3795#true} is VALID [2018-11-14 16:43:08,382 INFO L273 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {3795#true} is VALID [2018-11-14 16:43:08,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {3795#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {3795#true} is VALID [2018-11-14 16:43:08,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#true} assume ~bvslt32(~main__i~0, ~main__len~0); {3795#true} is VALID [2018-11-14 16:43:08,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {3795#true} assume ~bvslt32(~main__j~0, ~main__limit~0); {3795#true} is VALID [2018-11-14 16:43:08,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {3795#true} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3795#true} is VALID [2018-11-14 16:43:08,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {3795#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3833#(or (and (not (bvsle (_ bv0 32) main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__i~0)))} is VALID [2018-11-14 16:43:08,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {3833#(or (and (not (bvsle (_ bv0 32) main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__i~0)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3837#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:08,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {3837#(bvsle (_ bv0 32) main_~main__i~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3837#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:08,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {3837#(bvsle (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3844#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:08,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {3844#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {3796#false} is VALID [2018-11-14 16:43:08,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2018-11-14 16:43:08,427 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-14 16:43:08,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:08,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:08,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:08,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:08,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:08,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:08,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:08,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:08,459 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2018-11-14 16:43:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:09,267 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2018-11-14 16:43:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:43:09,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 16:43:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2018-11-14 16:43:09,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 119 transitions. [2018-11-14 16:43:09,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:09,756 INFO L225 Difference]: With dead ends: 145 [2018-11-14 16:43:09,756 INFO L226 Difference]: Without dead ends: 143 [2018-11-14 16:43:09,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-14 16:43:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2018-11-14 16:43:09,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:09,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 74 states. [2018-11-14 16:43:09,896 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 74 states. [2018-11-14 16:43:09,896 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 74 states. [2018-11-14 16:43:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:09,903 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2018-11-14 16:43:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2018-11-14 16:43:09,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:09,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:09,904 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 143 states. [2018-11-14 16:43:09,904 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 143 states. [2018-11-14 16:43:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:09,910 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2018-11-14 16:43:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2018-11-14 16:43:09,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:09,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:09,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:09,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:43:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-11-14 16:43:09,914 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 17 [2018-11-14 16:43:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:09,914 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-11-14 16:43:09,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-11-14 16:43:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:43:09,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:09,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:09,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:09,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-11-14 16:43:09,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:09,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:09,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:10,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 16:43:10,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {4395#true} is VALID [2018-11-14 16:43:10,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 16:43:10,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #139#return; {4395#true} is VALID [2018-11-14 16:43:10,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret4 := main(); {4395#true} is VALID [2018-11-14 16:43:10,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4395#true} is VALID [2018-11-14 16:43:10,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {4395#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {4418#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:10,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {4418#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {4422#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:10,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {4422#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {4422#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:10,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {4422#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:10,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {4429#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4448#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:10,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {4448#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {4396#false} is VALID [2018-11-14 16:43:10,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 16:43:10,120 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-14 16:43:10,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:10,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:10,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:10,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:43:10,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:10,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:10,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:10,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:10,175 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2018-11-14 16:43:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:11,698 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-11-14 16:43:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:43:11,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:43:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 16:43:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 16:43:11,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 149 transitions. [2018-11-14 16:43:12,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:12,025 INFO L225 Difference]: With dead ends: 146 [2018-11-14 16:43:12,026 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 16:43:12,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:43:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 16:43:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 77. [2018-11-14 16:43:12,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:12,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 77 states. [2018-11-14 16:43:12,163 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 77 states. [2018-11-14 16:43:12,163 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 77 states. [2018-11-14 16:43:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,168 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2018-11-14 16:43:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2018-11-14 16:43:12,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,169 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 144 states. [2018-11-14 16:43:12,169 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 144 states. [2018-11-14 16:43:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,174 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2018-11-14 16:43:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2018-11-14 16:43:12,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:12,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:43:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2018-11-14 16:43:12,178 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 18 [2018-11-14 16:43:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:12,178 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2018-11-14 16:43:12,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-11-14 16:43:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:43:12,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:12,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:12,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:12,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-11-14 16:43:12,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:12,180 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:12,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:12,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {5005#true} call ULTIMATE.init(); {5005#true} is VALID [2018-11-14 16:43:12,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {5005#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {5005#true} is VALID [2018-11-14 16:43:12,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {5005#true} assume true; {5005#true} is VALID [2018-11-14 16:43:12,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5005#true} {5005#true} #139#return; {5005#true} is VALID [2018-11-14 16:43:12,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {5005#true} call #t~ret4 := main(); {5005#true} is VALID [2018-11-14 16:43:12,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {5005#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {5005#true} is VALID [2018-11-14 16:43:12,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {5005#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {5005#true} is VALID [2018-11-14 16:43:12,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {5005#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5031#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:12,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5059#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:12,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {5059#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {5006#false} is VALID [2018-11-14 16:43:12,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {5006#false} assume !false; {5006#false} is VALID [2018-11-14 16:43:12,361 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-14 16:43:12,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:12,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-14 16:43:12,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:12,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:12,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:12,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:12,386 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 4 states. [2018-11-14 16:43:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,435 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2018-11-14 16:43:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:13,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-14 16:43:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2018-11-14 16:43:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2018-11-14 16:43:13,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 151 transitions. [2018-11-14 16:43:13,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:13,638 INFO L225 Difference]: With dead ends: 148 [2018-11-14 16:43:13,639 INFO L226 Difference]: Without dead ends: 146 [2018-11-14 16:43:13,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-14 16:43:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 78. [2018-11-14 16:43:13,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:13,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 78 states. [2018-11-14 16:43:13,741 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 78 states. [2018-11-14 16:43:13,741 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 78 states. [2018-11-14 16:43:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,746 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-11-14 16:43:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2018-11-14 16:43:13,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:13,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:13,747 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 146 states. [2018-11-14 16:43:13,747 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 146 states. [2018-11-14 16:43:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,751 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-11-14 16:43:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2018-11-14 16:43:13,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:13,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:13,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:13,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:43:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-11-14 16:43:13,754 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 19 [2018-11-14 16:43:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:13,755 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2018-11-14 16:43:13,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-11-14 16:43:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:43:13,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:13,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:13,756 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-11-14 16:43:13,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:13,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:13,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:14,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {5617#true} call ULTIMATE.init(); {5617#true} is VALID [2018-11-14 16:43:14,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {5617#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {5617#true} is VALID [2018-11-14 16:43:14,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {5617#true} assume true; {5617#true} is VALID [2018-11-14 16:43:14,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5617#true} {5617#true} #139#return; {5617#true} is VALID [2018-11-14 16:43:14,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {5617#true} call #t~ret4 := main(); {5617#true} is VALID [2018-11-14 16:43:14,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {5617#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {5617#true} is VALID [2018-11-14 16:43:14,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {5617#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {5640#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:14,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {5640#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:14,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:14,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:14,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {5644#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:14,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {5654#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5676#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:14,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {5676#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {5618#false} is VALID [2018-11-14 16:43:14,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2018-11-14 16:43:14,030 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-14 16:43:14,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:14,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:43:14,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:14,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:14,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:14,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:14,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:14,061 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 6 states. [2018-11-14 16:43:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,131 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2018-11-14 16:43:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:15,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:43:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 16:43:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 16:43:15,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 132 transitions. [2018-11-14 16:43:15,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:15,323 INFO L225 Difference]: With dead ends: 151 [2018-11-14 16:43:15,323 INFO L226 Difference]: Without dead ends: 149 [2018-11-14 16:43:15,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-14 16:43:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2018-11-14 16:43:15,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:15,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 83 states. [2018-11-14 16:43:15,606 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 83 states. [2018-11-14 16:43:15,606 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 83 states. [2018-11-14 16:43:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,612 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2018-11-14 16:43:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-11-14 16:43:15,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:15,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:15,613 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 149 states. [2018-11-14 16:43:15,613 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 149 states. [2018-11-14 16:43:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,617 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2018-11-14 16:43:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-11-14 16:43:15,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:15,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:15,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:15,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:43:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-11-14 16:43:15,619 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2018-11-14 16:43:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:15,620 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-11-14 16:43:15,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-14 16:43:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:43:15,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:15,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:15,621 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:15,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-11-14 16:43:15,622 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:15,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:15,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:16,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {6245#true} call ULTIMATE.init(); {6245#true} is VALID [2018-11-14 16:43:16,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {6245#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {6245#true} is VALID [2018-11-14 16:43:16,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {6245#true} assume true; {6245#true} is VALID [2018-11-14 16:43:16,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6245#true} {6245#true} #139#return; {6245#true} is VALID [2018-11-14 16:43:16,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {6245#true} call #t~ret4 := main(); {6245#true} is VALID [2018-11-14 16:43:16,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {6245#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {6245#true} is VALID [2018-11-14 16:43:16,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {6245#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6268#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {6268#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6302#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:16,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {6302#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6306#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:16,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {6306#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {6246#false} is VALID [2018-11-14 16:43:16,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {6246#false} assume !false; {6246#false} is VALID [2018-11-14 16:43:16,018 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-14 16:43:16,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:16,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:16,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:16,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:43:16,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:16,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:16,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:16,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:16,116 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 5 states. [2018-11-14 16:43:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:17,456 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2018-11-14 16:43:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:17,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:43:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2018-11-14 16:43:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2018-11-14 16:43:17,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 159 transitions. [2018-11-14 16:43:18,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:18,188 INFO L225 Difference]: With dead ends: 189 [2018-11-14 16:43:18,188 INFO L226 Difference]: Without dead ends: 187 [2018-11-14 16:43:18,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-14 16:43:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 84. [2018-11-14 16:43:18,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:18,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 84 states. [2018-11-14 16:43:18,514 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 84 states. [2018-11-14 16:43:18,514 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 84 states. [2018-11-14 16:43:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:18,520 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2018-11-14 16:43:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 217 transitions. [2018-11-14 16:43:18,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:18,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:18,521 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 187 states. [2018-11-14 16:43:18,521 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 187 states. [2018-11-14 16:43:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:18,526 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2018-11-14 16:43:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 217 transitions. [2018-11-14 16:43:18,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:18,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:18,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:18,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 16:43:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-11-14 16:43:18,530 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 21 [2018-11-14 16:43:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:18,530 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-11-14 16:43:18,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 16:43:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:43:18,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:18,531 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:18,531 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:18,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1663733890, now seen corresponding path program 1 times [2018-11-14 16:43:18,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:18,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:18,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:19,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {6995#true} call ULTIMATE.init(); {6995#true} is VALID [2018-11-14 16:43:19,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {6995#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {6995#true} is VALID [2018-11-14 16:43:19,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {6995#true} assume true; {6995#true} is VALID [2018-11-14 16:43:19,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6995#true} {6995#true} #139#return; {6995#true} is VALID [2018-11-14 16:43:19,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {6995#true} call #t~ret4 := main(); {6995#true} is VALID [2018-11-14 16:43:19,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {6995#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {6995#true} is VALID [2018-11-14 16:43:19,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {6995#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {7018#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:19,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {7018#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {7022#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {7032#(and (not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)) (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {7048#(and (bvslt (_ bv0 32) main_~main__len~0) (not (bvslt (_ bv1 32) main_~main__len~0)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:43:19,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {7048#(and (bvslt (_ bv0 32) main_~main__len~0) (not (bvslt (_ bv1 32) main_~main__len~0)) (= (_ bv1 32) main_~main__i~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {6996#false} is VALID [2018-11-14 16:43:19,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {6996#false} assume ~bvslt32(~main__j~0, ~main__limit~0); {6996#false} is VALID [2018-11-14 16:43:19,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {6996#false} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6996#false} is VALID [2018-11-14 16:43:19,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {6996#false} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6996#false} is VALID [2018-11-14 16:43:19,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {6996#false} assume ~__VERIFIER_assert__cond~1 == 0bv32; {6996#false} is VALID [2018-11-14 16:43:19,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {6996#false} assume !false; {6996#false} is VALID [2018-11-14 16:43:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:19,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:19,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {6996#false} assume !false; {6996#false} is VALID [2018-11-14 16:43:19,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {6996#false} assume ~__VERIFIER_assert__cond~1 == 0bv32; {6996#false} is VALID [2018-11-14 16:43:19,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {6996#false} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6996#false} is VALID [2018-11-14 16:43:19,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {6996#false} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6996#false} is VALID [2018-11-14 16:43:19,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {6996#false} assume ~bvslt32(~main__j~0, ~main__limit~0); {6996#false} is VALID [2018-11-14 16:43:19,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {7082#(not (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {6996#false} is VALID [2018-11-14 16:43:19,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {7082#(not (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:43:19,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:19,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:19,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:19,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:19,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {6995#true} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {7086#(not (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:43:19,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {6995#true} assume ~bvslt32(~main__j~0, ~main__limit~0); {6995#true} is VALID [2018-11-14 16:43:19,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {6995#true} assume ~bvslt32(~main__i~0, ~main__len~0); {6995#true} is VALID [2018-11-14 16:43:19,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {6995#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {6995#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {6995#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {6995#true} call #t~ret4 := main(); {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6995#true} {6995#true} #139#return; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {6995#true} assume true; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {6995#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {6995#true} is VALID [2018-11-14 16:43:19,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {6995#true} call ULTIMATE.init(); {6995#true} is VALID [2018-11-14 16:43:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:19,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:43:19,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-14 16:43:19,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-14 16:43:19,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:19,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:19,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:19,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:19,357 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 8 states. [2018-11-14 16:43:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:20,341 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2018-11-14 16:43:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:43:20,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-14 16:43:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 16:43:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 16:43:20,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 149 transitions. [2018-11-14 16:43:20,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:20,904 INFO L225 Difference]: With dead ends: 173 [2018-11-14 16:43:20,904 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 16:43:20,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 16:43:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2018-11-14 16:43:21,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:21,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 92 states. [2018-11-14 16:43:21,003 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 92 states. [2018-11-14 16:43:21,003 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 92 states. [2018-11-14 16:43:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:21,006 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-14 16:43:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-11-14 16:43:21,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:21,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:21,007 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 101 states. [2018-11-14 16:43:21,007 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 101 states. [2018-11-14 16:43:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:21,010 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-14 16:43:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-11-14 16:43:21,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:21,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:21,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:21,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:43:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-11-14 16:43:21,013 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 22 [2018-11-14 16:43:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:21,013 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-11-14 16:43:21,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:43:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-11-14 16:43:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:43:21,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:21,014 INFO L375 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] [2018-11-14 16:43:21,014 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:21,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-11-14 16:43:21,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:21,015 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:21,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:21,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:21,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {7640#true} call ULTIMATE.init(); {7640#true} is VALID [2018-11-14 16:43:21,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {7640#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {7640#true} is VALID [2018-11-14 16:43:21,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {7640#true} assume true; {7640#true} is VALID [2018-11-14 16:43:21,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7640#true} {7640#true} #139#return; {7640#true} is VALID [2018-11-14 16:43:21,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {7640#true} call #t~ret4 := main(); {7640#true} is VALID [2018-11-14 16:43:21,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {7640#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {7640#true} is VALID [2018-11-14 16:43:21,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {7640#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {7663#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:21,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {7663#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {7667#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:21,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {7667#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {7667#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:21,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {7667#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:21,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {7674#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7699#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:21,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {7699#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7699#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:21,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {7699#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7706#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:21,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {7706#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {7641#false} is VALID [2018-11-14 16:43:21,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {7641#false} assume !false; {7641#false} is VALID [2018-11-14 16:43:21,652 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-14 16:43:21,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:21,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:21,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:43:21,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 16:43:21,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:21,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:43:21,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:21,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:43:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:43:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:21,692 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 7 states. [2018-11-14 16:43:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:24,351 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2018-11-14 16:43:24,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:43:24,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 16:43:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 279 transitions. [2018-11-14 16:43:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 279 transitions. [2018-11-14 16:43:24,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 279 transitions. [2018-11-14 16:43:25,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:25,101 INFO L225 Difference]: With dead ends: 321 [2018-11-14 16:43:25,101 INFO L226 Difference]: Without dead ends: 252 [2018-11-14 16:43:25,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:43:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-14 16:43:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 100. [2018-11-14 16:43:25,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:25,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 100 states. [2018-11-14 16:43:25,232 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 100 states. [2018-11-14 16:43:25,232 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 100 states. [2018-11-14 16:43:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:25,237 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2018-11-14 16:43:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2018-11-14 16:43:25,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:25,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:25,238 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 252 states. [2018-11-14 16:43:25,238 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 252 states. [2018-11-14 16:43:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:25,242 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2018-11-14 16:43:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2018-11-14 16:43:25,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:25,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:25,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:25,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-14 16:43:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2018-11-14 16:43:25,245 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 22 [2018-11-14 16:43:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:25,245 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2018-11-14 16:43:25,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:43:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2018-11-14 16:43:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:43:25,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:25,246 INFO L375 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] [2018-11-14 16:43:25,246 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:25,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-11-14 16:43:25,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:25,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:25,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:25,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:25,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {8707#true} call ULTIMATE.init(); {8707#true} is VALID [2018-11-14 16:43:25,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {8707#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {8707#true} is VALID [2018-11-14 16:43:25,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {8707#true} assume true; {8707#true} is VALID [2018-11-14 16:43:25,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8707#true} {8707#true} #139#return; {8707#true} is VALID [2018-11-14 16:43:25,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {8707#true} call #t~ret4 := main(); {8707#true} is VALID [2018-11-14 16:43:25,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {8707#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {8707#true} is VALID [2018-11-14 16:43:25,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {8707#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {8707#true} is VALID [2018-11-14 16:43:25,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {8707#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8733#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {8733#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8764#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {8764#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8764#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {8764#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8764#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:25,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {8764#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8774#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:25,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {8774#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {8708#false} is VALID [2018-11-14 16:43:25,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {8708#false} assume !false; {8708#false} is VALID [2018-11-14 16:43:25,389 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-14 16:43:25,389 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:25,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:25,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:25,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 16:43:25,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:25,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:25,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:25,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:25,425 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 5 states. [2018-11-14 16:43:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:27,051 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2018-11-14 16:43:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:43:27,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 16:43:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2018-11-14 16:43:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2018-11-14 16:43:27,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 227 transitions. [2018-11-14 16:43:27,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:27,327 INFO L225 Difference]: With dead ends: 256 [2018-11-14 16:43:27,328 INFO L226 Difference]: Without dead ends: 254 [2018-11-14 16:43:27,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-14 16:43:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 101. [2018-11-14 16:43:27,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:27,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand 101 states. [2018-11-14 16:43:27,504 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 101 states. [2018-11-14 16:43:27,505 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 101 states. [2018-11-14 16:43:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:27,510 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2018-11-14 16:43:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 282 transitions. [2018-11-14 16:43:27,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:27,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:27,512 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 254 states. [2018-11-14 16:43:27,512 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 254 states. [2018-11-14 16:43:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:27,516 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2018-11-14 16:43:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 282 transitions. [2018-11-14 16:43:27,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:27,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:27,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:27,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 16:43:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2018-11-14 16:43:27,519 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 23 [2018-11-14 16:43:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:27,519 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2018-11-14 16:43:27,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2018-11-14 16:43:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:43:27,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:27,520 INFO L375 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] [2018-11-14 16:43:27,520 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:27,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-11-14 16:43:27,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:27,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:27,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:27,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {9700#true} call ULTIMATE.init(); {9700#true} is VALID [2018-11-14 16:43:27,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {9700#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {9700#true} is VALID [2018-11-14 16:43:27,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {9700#true} assume true; {9700#true} is VALID [2018-11-14 16:43:27,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9700#true} {9700#true} #139#return; {9700#true} is VALID [2018-11-14 16:43:27,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {9700#true} call #t~ret4 := main(); {9700#true} is VALID [2018-11-14 16:43:27,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {9700#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {9700#true} is VALID [2018-11-14 16:43:27,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {9700#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {9723#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:27,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {9723#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {9727#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:27,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {9727#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {9727#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:27,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {9727#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:27,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {9734#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:27,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:27,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:27,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:27,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {9759#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~13 == 0bv32);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9772#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:27,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {9772#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~14 == 0bv32; {9701#false} is VALID [2018-11-14 16:43:27,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {9701#false} assume !false; {9701#false} is VALID [2018-11-14 16:43:27,771 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-14 16:43:27,771 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:27,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:27,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:43:27,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 16:43:27,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:27,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:43:27,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:27,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:43:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:43:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:27,816 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 7 states. [2018-11-14 16:43:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:30,540 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2018-11-14 16:43:30,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:43:30,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 16:43:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2018-11-14 16:43:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2018-11-14 16:43:30,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 233 transitions. [2018-11-14 16:43:31,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:31,081 INFO L225 Difference]: With dead ends: 258 [2018-11-14 16:43:31,081 INFO L226 Difference]: Without dead ends: 256 [2018-11-14 16:43:31,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:43:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-14 16:43:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 102. [2018-11-14 16:43:31,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:31,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 102 states. [2018-11-14 16:43:31,273 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 102 states. [2018-11-14 16:43:31,273 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 102 states. [2018-11-14 16:43:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:31,278 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2018-11-14 16:43:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 284 transitions. [2018-11-14 16:43:31,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:31,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:31,279 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 256 states. [2018-11-14 16:43:31,279 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 256 states. [2018-11-14 16:43:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:31,284 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2018-11-14 16:43:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 284 transitions. [2018-11-14 16:43:31,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:31,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:31,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:31,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-14 16:43:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-11-14 16:43:31,287 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 24 [2018-11-14 16:43:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:31,288 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-11-14 16:43:31,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:43:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-11-14 16:43:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:43:31,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:31,288 INFO L375 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] [2018-11-14 16:43:31,289 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:31,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-11-14 16:43:31,290 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:31,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:31,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:31,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {10713#true} call ULTIMATE.init(); {10713#true} is VALID [2018-11-14 16:43:31,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {10713#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {10713#true} is VALID [2018-11-14 16:43:31,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {10713#true} assume true; {10713#true} is VALID [2018-11-14 16:43:31,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10713#true} {10713#true} #139#return; {10713#true} is VALID [2018-11-14 16:43:31,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {10713#true} call #t~ret4 := main(); {10713#true} is VALID [2018-11-14 16:43:31,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {10713#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {10713#true} is VALID [2018-11-14 16:43:31,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {10713#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {10713#true} is VALID [2018-11-14 16:43:31,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {10713#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10739#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {10739#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10770#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {10770#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10770#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {10770#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {10770#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {10770#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {10770#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {10770#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~13 == 0bv32);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10783#(= (_ bv2 32) main_~main__j~0)} is VALID [2018-11-14 16:43:31,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {10783#(= (_ bv2 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10787#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:31,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {10787#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~15 == 0bv32; {10714#false} is VALID [2018-11-14 16:43:31,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {10714#false} assume !false; {10714#false} is VALID [2018-11-14 16:43:31,449 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-14 16:43:31,449 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:31,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:31,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:31,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 16:43:31,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:31,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:31,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:31,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:31,511 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 6 states. [2018-11-14 16:43:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,023 INFO L93 Difference]: Finished difference Result 350 states and 388 transitions. [2018-11-14 16:43:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:43:34,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 16:43:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 317 transitions. [2018-11-14 16:43:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 317 transitions. [2018-11-14 16:43:34,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 317 transitions. [2018-11-14 16:43:34,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:34,423 INFO L225 Difference]: With dead ends: 350 [2018-11-14 16:43:34,423 INFO L226 Difference]: Without dead ends: 348 [2018-11-14 16:43:34,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:43:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-14 16:43:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 103. [2018-11-14 16:43:34,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:34,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand 103 states. [2018-11-14 16:43:34,674 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand 103 states. [2018-11-14 16:43:34,674 INFO L87 Difference]: Start difference. First operand 348 states. Second operand 103 states. [2018-11-14 16:43:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,682 INFO L93 Difference]: Finished difference Result 348 states and 386 transitions. [2018-11-14 16:43:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 386 transitions. [2018-11-14 16:43:34,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:34,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:34,683 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 348 states. [2018-11-14 16:43:34,683 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 348 states. [2018-11-14 16:43:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,691 INFO L93 Difference]: Finished difference Result 348 states and 386 transitions. [2018-11-14 16:43:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 386 transitions. [2018-11-14 16:43:34,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:34,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:34,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:34,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 16:43:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-11-14 16:43:34,694 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 25 [2018-11-14 16:43:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:34,695 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-11-14 16:43:34,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-11-14 16:43:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:43:34,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:34,695 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:34,696 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:34,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1002377772, now seen corresponding path program 1 times [2018-11-14 16:43:34,697 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:34,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:34,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:34,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {12007#true} call ULTIMATE.init(); {12007#true} is VALID [2018-11-14 16:43:34,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {12007#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {12007#true} is VALID [2018-11-14 16:43:34,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {12007#true} assume true; {12007#true} is VALID [2018-11-14 16:43:34,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12007#true} {12007#true} #139#return; {12007#true} is VALID [2018-11-14 16:43:34,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {12007#true} call #t~ret4 := main(); {12007#true} is VALID [2018-11-14 16:43:34,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {12007#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {12007#true} is VALID [2018-11-14 16:43:34,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {12007#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {12030#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {12030#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {12067#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {12067#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {12067#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {12067#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {12067#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {12067#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12067#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {12067#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12080#(= (_ bv1 32) main_~__VERIFIER_assert__cond~1)} is VALID [2018-11-14 16:43:34,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {12080#(= (_ bv1 32) main_~__VERIFIER_assert__cond~1)} assume ~__VERIFIER_assert__cond~1 == 0bv32; {12008#false} is VALID [2018-11-14 16:43:34,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {12008#false} assume !false; {12008#false} is VALID [2018-11-14 16:43:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:34,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:34,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {12008#false} assume !false; {12008#false} is VALID [2018-11-14 16:43:34,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {12090#(not (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {12008#false} is VALID [2018-11-14 16:43:34,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(bvsle (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12090#(not (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} is VALID [2018-11-14 16:43:34,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {12094#(bvsle (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12094#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {12094#(bvsle (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {12094#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {12094#(bvsle (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {12094#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {12094#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:34,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {12007#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {12107#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:34,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {12007#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {12007#true} is VALID [2018-11-14 16:43:34,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {12007#true} call #t~ret4 := main(); {12007#true} is VALID [2018-11-14 16:43:34,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12007#true} {12007#true} #139#return; {12007#true} is VALID [2018-11-14 16:43:34,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {12007#true} assume true; {12007#true} is VALID [2018-11-14 16:43:34,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {12007#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {12007#true} is VALID [2018-11-14 16:43:34,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {12007#true} call ULTIMATE.init(); {12007#true} is VALID [2018-11-14 16:43:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:34,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:34,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:43:34,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 16:43:34,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:34,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:34,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:34,998 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 8 states. [2018-11-14 16:43:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:36,667 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2018-11-14 16:43:36,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:43:36,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 16:43:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-11-14 16:43:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-11-14 16:43:36,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 195 transitions. [2018-11-14 16:43:37,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:37,096 INFO L225 Difference]: With dead ends: 287 [2018-11-14 16:43:37,096 INFO L226 Difference]: Without dead ends: 285 [2018-11-14 16:43:37,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:43:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-14 16:43:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 166. [2018-11-14 16:43:37,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:37,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand 166 states. [2018-11-14 16:43:37,450 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 166 states. [2018-11-14 16:43:37,451 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 166 states. [2018-11-14 16:43:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:37,457 INFO L93 Difference]: Finished difference Result 285 states and 325 transitions. [2018-11-14 16:43:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2018-11-14 16:43:37,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:37,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:37,458 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 285 states. [2018-11-14 16:43:37,458 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 285 states. [2018-11-14 16:43:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:37,464 INFO L93 Difference]: Finished difference Result 285 states and 325 transitions. [2018-11-14 16:43:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2018-11-14 16:43:37,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:37,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:37,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:37,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-14 16:43:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2018-11-14 16:43:37,469 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 25 [2018-11-14 16:43:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:37,469 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2018-11-14 16:43:37,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:43:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2018-11-14 16:43:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:43:37,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:37,470 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:37,470 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:37,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash -910704933, now seen corresponding path program 1 times [2018-11-14 16:43:37,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:37,471 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:37,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:37,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2018-11-14 16:43:37,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {13264#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {13264#true} is VALID [2018-11-14 16:43:37,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {13264#true} assume true; {13264#true} is VALID [2018-11-14 16:43:37,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13264#true} {13264#true} #139#return; {13264#true} is VALID [2018-11-14 16:43:37,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {13264#true} call #t~ret4 := main(); {13264#true} is VALID [2018-11-14 16:43:37,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {13264#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {13264#true} is VALID [2018-11-14 16:43:37,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {13264#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {13287#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {13287#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {13324#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {13324#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {13324#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {13324#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {13324#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {13324#(= (_ bv1 32) main_~main__i~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {13324#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {13324#(= (_ bv1 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13324#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {13324#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13340#(= (_ bv1 32) main_~__VERIFIER_assert__cond~3)} is VALID [2018-11-14 16:43:37,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {13340#(= (_ bv1 32) main_~__VERIFIER_assert__cond~3)} assume ~__VERIFIER_assert__cond~3 == 0bv32; {13265#false} is VALID [2018-11-14 16:43:37,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2018-11-14 16:43:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:37,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:37,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2018-11-14 16:43:37,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {13350#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~3 == 0bv32; {13265#false} is VALID [2018-11-14 16:43:37,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {13354#(bvsle (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13350#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-14 16:43:37,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {13354#(bvsle (_ bv0 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13354#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {13354#(bvsle (_ bv0 32) main_~main__i~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {13354#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {13354#(bvsle (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {13354#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {13354#(bvsle (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {13354#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {13354#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:43:37,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {13264#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {13370#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:37,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {13264#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {13264#true} is VALID [2018-11-14 16:43:37,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {13264#true} call #t~ret4 := main(); {13264#true} is VALID [2018-11-14 16:43:37,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13264#true} {13264#true} #139#return; {13264#true} is VALID [2018-11-14 16:43:37,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {13264#true} assume true; {13264#true} is VALID [2018-11-14 16:43:37,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {13264#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {13264#true} is VALID [2018-11-14 16:43:37,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2018-11-14 16:43:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:37,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:37,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:43:37,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 16:43:37,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:37,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:37,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:37,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:37,805 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand 8 states. [2018-11-14 16:43:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:41,620 INFO L93 Difference]: Finished difference Result 419 states and 483 transitions. [2018-11-14 16:43:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:43:41,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 16:43:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2018-11-14 16:43:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2018-11-14 16:43:41,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 280 transitions. [2018-11-14 16:43:41,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:42,005 INFO L225 Difference]: With dead ends: 419 [2018-11-14 16:43:42,005 INFO L226 Difference]: Without dead ends: 409 [2018-11-14 16:43:42,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:43:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-14 16:43:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 169. [2018-11-14 16:43:42,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:42,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand 169 states. [2018-11-14 16:43:42,368 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand 169 states. [2018-11-14 16:43:42,368 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 169 states. [2018-11-14 16:43:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:42,378 INFO L93 Difference]: Finished difference Result 409 states and 465 transitions. [2018-11-14 16:43:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 465 transitions. [2018-11-14 16:43:42,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:42,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:42,379 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 409 states. [2018-11-14 16:43:42,380 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 409 states. [2018-11-14 16:43:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:42,389 INFO L93 Difference]: Finished difference Result 409 states and 465 transitions. [2018-11-14 16:43:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 465 transitions. [2018-11-14 16:43:42,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:42,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:42,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:42,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-14 16:43:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2018-11-14 16:43:42,393 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 26 [2018-11-14 16:43:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:42,393 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2018-11-14 16:43:42,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:43:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2018-11-14 16:43:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:43:42,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:42,394 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:42,394 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:42,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1832921243, now seen corresponding path program 1 times [2018-11-14 16:43:42,395 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:42,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:42,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2018-11-14 16:43:42,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {14929#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {14929#true} is VALID [2018-11-14 16:43:42,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2018-11-14 16:43:42,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #139#return; {14929#true} is VALID [2018-11-14 16:43:42,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret4 := main(); {14929#true} is VALID [2018-11-14 16:43:42,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {14929#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {14929#true} is VALID [2018-11-14 16:43:42,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {14929#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {14952#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:42,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {14952#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {14956#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:42,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {14956#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {14956#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:42,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {14956#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:42,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {14963#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__i~0, ~main__len~0); {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__j~0, ~main__limit~0); {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:42,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {14991#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {15010#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:42,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {15010#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {14930#false} is VALID [2018-11-14 16:43:42,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2018-11-14 16:43:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:42,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:42,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2018-11-14 16:43:42,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {15020#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {14930#false} is VALID [2018-11-14 16:43:42,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {15020#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-14 16:43:42,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {15024#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {15071#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {15043#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:42,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {15071#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {15071#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:42,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {15078#(or (bvslt (_ bv1 32) main_~main__bufsize~0) (not (bvslt (_ bv0 32) main_~main__limit~0)))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {15071#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:42,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {14929#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {15078#(or (bvslt (_ bv1 32) main_~main__bufsize~0) (not (bvslt (_ bv0 32) main_~main__limit~0)))} is VALID [2018-11-14 16:43:42,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {14929#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {14929#true} is VALID [2018-11-14 16:43:42,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret4 := main(); {14929#true} is VALID [2018-11-14 16:43:42,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #139#return; {14929#true} is VALID [2018-11-14 16:43:42,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2018-11-14 16:43:42,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {14929#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {14929#true} is VALID [2018-11-14 16:43:42,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2018-11-14 16:43:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:42,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:42,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:43:42,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 16:43:42,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:42,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:43:43,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:43,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:43:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:43:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:43:43,003 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand 12 states. [2018-11-14 16:43:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,786 INFO L93 Difference]: Finished difference Result 354 states and 413 transitions. [2018-11-14 16:43:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:43:46,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 16:43:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2018-11-14 16:43:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2018-11-14 16:43:46,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 225 transitions. [2018-11-14 16:43:47,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:47,514 INFO L225 Difference]: With dead ends: 354 [2018-11-14 16:43:47,514 INFO L226 Difference]: Without dead ends: 352 [2018-11-14 16:43:47,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:43:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-14 16:43:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 167. [2018-11-14 16:43:47,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:47,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand 167 states. [2018-11-14 16:43:47,840 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 167 states. [2018-11-14 16:43:47,840 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 167 states. [2018-11-14 16:43:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:47,847 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2018-11-14 16:43:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 406 transitions. [2018-11-14 16:43:47,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:47,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:47,848 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 352 states. [2018-11-14 16:43:47,848 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 352 states. [2018-11-14 16:43:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:47,857 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2018-11-14 16:43:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 406 transitions. [2018-11-14 16:43:47,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:47,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:47,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:47,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 16:43:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2018-11-14 16:43:47,861 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 27 [2018-11-14 16:43:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:47,862 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2018-11-14 16:43:47,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:43:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2018-11-14 16:43:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:43:47,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:47,862 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:47,863 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:47,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash 985986785, now seen corresponding path program 1 times [2018-11-14 16:43:47,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:47,864 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:47,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:48,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {16437#true} call ULTIMATE.init(); {16437#true} is VALID [2018-11-14 16:43:48,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {16437#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {16437#true} is VALID [2018-11-14 16:43:48,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {16437#true} assume true; {16437#true} is VALID [2018-11-14 16:43:48,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16437#true} {16437#true} #139#return; {16437#true} is VALID [2018-11-14 16:43:48,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {16437#true} call #t~ret4 := main(); {16437#true} is VALID [2018-11-14 16:43:48,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {16437#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {16437#true} is VALID [2018-11-14 16:43:48,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {16437#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {16437#true} is VALID [2018-11-14 16:43:48,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {16437#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {16463#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {16463#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,188 INFO L273 TraceCheckUtils]: 21: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {16497#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {16497#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {16519#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {16519#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {16438#false} is VALID [2018-11-14 16:43:48,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {16438#false} assume !false; {16438#false} is VALID [2018-11-14 16:43:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:48,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:48,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {16438#false} assume !false; {16438#false} is VALID [2018-11-14 16:43:48,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {16529#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {16438#false} is VALID [2018-11-14 16:43:48,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {16529#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} is VALID [2018-11-14 16:43:48,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume !~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0); {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {16533#(bvsle (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {16533#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:48,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {16437#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {16555#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:48,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {16437#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {16437#true} is VALID [2018-11-14 16:43:48,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {16437#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {16437#true} is VALID [2018-11-14 16:43:48,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {16437#true} call #t~ret4 := main(); {16437#true} is VALID [2018-11-14 16:43:48,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16437#true} {16437#true} #139#return; {16437#true} is VALID [2018-11-14 16:43:48,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {16437#true} assume true; {16437#true} is VALID [2018-11-14 16:43:48,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {16437#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {16437#true} is VALID [2018-11-14 16:43:48,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {16437#true} call ULTIMATE.init(); {16437#true} is VALID [2018-11-14 16:43:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:48,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:48,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:43:48,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:43:48,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:48,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:48,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:48,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:48,337 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand 8 states. [2018-11-14 16:43:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:51,999 INFO L93 Difference]: Finished difference Result 584 states and 664 transitions. [2018-11-14 16:43:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:43:51,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:43:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 406 transitions. [2018-11-14 16:43:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 406 transitions. [2018-11-14 16:43:52,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 406 transitions. [2018-11-14 16:43:52,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:52,566 INFO L225 Difference]: With dead ends: 584 [2018-11-14 16:43:52,567 INFO L226 Difference]: Without dead ends: 567 [2018-11-14 16:43:52,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:43:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-14 16:43:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 189. [2018-11-14 16:43:53,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:53,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 567 states. Second operand 189 states. [2018-11-14 16:43:53,077 INFO L74 IsIncluded]: Start isIncluded. First operand 567 states. Second operand 189 states. [2018-11-14 16:43:53,077 INFO L87 Difference]: Start difference. First operand 567 states. Second operand 189 states. [2018-11-14 16:43:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:53,091 INFO L93 Difference]: Finished difference Result 567 states and 636 transitions. [2018-11-14 16:43:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 636 transitions. [2018-11-14 16:43:53,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:53,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:53,093 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 567 states. [2018-11-14 16:43:53,093 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 567 states. [2018-11-14 16:43:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:53,110 INFO L93 Difference]: Finished difference Result 567 states and 636 transitions. [2018-11-14 16:43:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 636 transitions. [2018-11-14 16:43:53,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:53,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:53,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:53,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-14 16:43:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2018-11-14 16:43:53,115 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 28 [2018-11-14 16:43:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:53,115 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2018-11-14 16:43:53,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:43:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2018-11-14 16:43:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:43:53,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:53,116 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:53,117 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:53,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1026691398, now seen corresponding path program 1 times [2018-11-14 16:43:53,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:53,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:53,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:53,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {18656#true} call ULTIMATE.init(); {18656#true} is VALID [2018-11-14 16:43:53,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {18656#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {18656#true} is VALID [2018-11-14 16:43:53,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {18656#true} assume true; {18656#true} is VALID [2018-11-14 16:43:53,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18656#true} {18656#true} #139#return; {18656#true} is VALID [2018-11-14 16:43:53,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {18656#true} call #t~ret4 := main(); {18656#true} is VALID [2018-11-14 16:43:53,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {18656#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {18656#true} is VALID [2018-11-14 16:43:53,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {18656#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {18679#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:53,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {18679#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {18683#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:53,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {18683#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {18683#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:53,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {18683#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:43:53,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {18690#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__i~0, ~main__len~0); {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__j~0, ~main__limit~0); {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:43:53,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {18718#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {18743#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:53,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {18743#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {18657#false} is VALID [2018-11-14 16:43:53,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {18657#false} assume !false; {18657#false} is VALID [2018-11-14 16:43:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:53,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:53,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {18657#false} assume !false; {18657#false} is VALID [2018-11-14 16:43:53,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {18753#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {18657#false} is VALID [2018-11-14 16:43:53,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {18753#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-14 16:43:53,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {18757#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {18810#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {18782#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:43:53,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {18810#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {18810#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:53,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {18817#(or (bvslt (_ bv1 32) main_~main__bufsize~0) (not (bvslt (_ bv0 32) main_~main__limit~0)))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {18810#(or (not (bvslt main_~main__j~0 main_~main__limit~0)) (bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:43:53,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {18656#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {18817#(or (bvslt (_ bv1 32) main_~main__bufsize~0) (not (bvslt (_ bv0 32) main_~main__limit~0)))} is VALID [2018-11-14 16:43:53,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {18656#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {18656#true} is VALID [2018-11-14 16:43:53,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {18656#true} call #t~ret4 := main(); {18656#true} is VALID [2018-11-14 16:43:53,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18656#true} {18656#true} #139#return; {18656#true} is VALID [2018-11-14 16:43:53,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {18656#true} assume true; {18656#true} is VALID [2018-11-14 16:43:53,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {18656#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {18656#true} is VALID [2018-11-14 16:43:53,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {18656#true} call ULTIMATE.init(); {18656#true} is VALID [2018-11-14 16:43:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:53,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:43:53,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-14 16:43:53,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:53,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:43:53,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:53,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:43:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:43:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:43:53,714 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand 12 states. [2018-11-14 16:43:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:57,278 INFO L93 Difference]: Finished difference Result 311 states and 363 transitions. [2018-11-14 16:43:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:43:57,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-14 16:43:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2018-11-14 16:43:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2018-11-14 16:43:57,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 196 transitions. [2018-11-14 16:43:57,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:57,857 INFO L225 Difference]: With dead ends: 311 [2018-11-14 16:43:57,857 INFO L226 Difference]: Without dead ends: 309 [2018-11-14 16:43:57,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:43:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-14 16:43:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 187. [2018-11-14 16:43:58,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:58,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand 187 states. [2018-11-14 16:43:58,270 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand 187 states. [2018-11-14 16:43:58,270 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 187 states. [2018-11-14 16:43:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:58,277 INFO L93 Difference]: Finished difference Result 309 states and 359 transitions. [2018-11-14 16:43:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 359 transitions. [2018-11-14 16:43:58,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:58,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:58,278 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 309 states. [2018-11-14 16:43:58,278 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 309 states. [2018-11-14 16:43:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:58,284 INFO L93 Difference]: Finished difference Result 309 states and 359 transitions. [2018-11-14 16:43:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 359 transitions. [2018-11-14 16:43:58,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:58,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:58,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:58,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-14 16:43:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2018-11-14 16:43:58,289 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 29 [2018-11-14 16:43:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:58,289 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2018-11-14 16:43:58,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:43:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2018-11-14 16:43:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:43:58,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:58,290 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:58,291 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:58,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1762659139, now seen corresponding path program 1 times [2018-11-14 16:43:58,291 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:58,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:58,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:58,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {20070#true} call ULTIMATE.init(); {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {20070#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {20070#true} assume true; {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20070#true} {20070#true} #139#return; {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {20070#true} call #t~ret4 := main(); {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {20070#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {20070#true} is VALID [2018-11-14 16:43:58,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {20070#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {20070#true} is VALID [2018-11-14 16:43:58,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {20070#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,427 INFO L273 TraceCheckUtils]: 9: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {20096#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {20096#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {20130#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {20130#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {20158#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:58,437 INFO L273 TraceCheckUtils]: 28: Hoare triple {20158#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {20071#false} is VALID [2018-11-14 16:43:58,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {20071#false} assume !false; {20071#false} is VALID [2018-11-14 16:43:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:58,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:58,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {20071#false} assume !false; {20071#false} is VALID [2018-11-14 16:43:58,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {20168#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {20071#false} is VALID [2018-11-14 16:43:58,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {20168#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} is VALID [2018-11-14 16:43:58,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {20172#(bvsle (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {20172#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:43:58,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {20070#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {20200#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:43:58,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {20070#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {20070#true} is VALID [2018-11-14 16:43:58,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {20070#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {20070#true} is VALID [2018-11-14 16:43:58,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {20070#true} call #t~ret4 := main(); {20070#true} is VALID [2018-11-14 16:43:58,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20070#true} {20070#true} #139#return; {20070#true} is VALID [2018-11-14 16:43:58,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {20070#true} assume true; {20070#true} is VALID [2018-11-14 16:43:58,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {20070#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {20070#true} is VALID [2018-11-14 16:43:58,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {20070#true} call ULTIMATE.init(); {20070#true} is VALID [2018-11-14 16:43:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (24)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:43:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:43:58,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-14 16:43:58,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:58,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:58,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:58,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:58,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:58,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:58,772 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 8 states. [2018-11-14 16:44:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:01,840 INFO L93 Difference]: Finished difference Result 431 states and 492 transitions. [2018-11-14 16:44:01,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:44:01,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-14 16:44:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 324 transitions. [2018-11-14 16:44:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 324 transitions. [2018-11-14 16:44:01,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 324 transitions. [2018-11-14 16:44:02,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:02,365 INFO L225 Difference]: With dead ends: 431 [2018-11-14 16:44:02,365 INFO L226 Difference]: Without dead ends: 429 [2018-11-14 16:44:02,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:44:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-14 16:44:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 191. [2018-11-14 16:44:03,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:03,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 191 states. [2018-11-14 16:44:03,032 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 191 states. [2018-11-14 16:44:03,033 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 191 states. [2018-11-14 16:44:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,042 INFO L93 Difference]: Finished difference Result 429 states and 488 transitions. [2018-11-14 16:44:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 488 transitions. [2018-11-14 16:44:03,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,043 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 429 states. [2018-11-14 16:44:03,043 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 429 states. [2018-11-14 16:44:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,054 INFO L93 Difference]: Finished difference Result 429 states and 488 transitions. [2018-11-14 16:44:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 488 transitions. [2018-11-14 16:44:03,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:03,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-14 16:44:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 230 transitions. [2018-11-14 16:44:03,058 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 230 transitions. Word has length 30 [2018-11-14 16:44:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:03,058 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 230 transitions. [2018-11-14 16:44:03,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:44:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 230 transitions. [2018-11-14 16:44:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:44:03,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:03,059 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:03,059 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:03,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1192144672, now seen corresponding path program 1 times [2018-11-14 16:44:03,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:03,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {21865#true} call ULTIMATE.init(); {21865#true} is VALID [2018-11-14 16:44:03,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {21865#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {21865#true} is VALID [2018-11-14 16:44:03,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {21865#true} assume true; {21865#true} is VALID [2018-11-14 16:44:03,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21865#true} {21865#true} #139#return; {21865#true} is VALID [2018-11-14 16:44:03,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {21865#true} call #t~ret4 := main(); {21865#true} is VALID [2018-11-14 16:44:03,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {21865#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {21865#true} is VALID [2018-11-14 16:44:03,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {21865#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {21888#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:03,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {21888#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:44:03,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:44:03,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} is VALID [2018-11-14 16:44:03,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {21892#(and (= (_ bv0 32) main_~main__i~0) (bvslt main_~main__i~0 main_~main__len~0))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} is VALID [2018-11-14 16:44:03,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {21902#(and (= (_ bv0 32) main_~main__i~0) (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {21927#(and (bvslt (_ bv1 32) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-14 16:44:03,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {21937#(and (bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0) (= (_ bv1 32) main_~main__i~0))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {21959#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:03,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {21959#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {21866#false} is VALID [2018-11-14 16:44:03,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {21866#false} assume !false; {21866#false} is VALID [2018-11-14 16:44:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:03,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:03,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {21866#false} assume !false; {21866#false} is VALID [2018-11-14 16:44:03,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {21969#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {21866#false} is VALID [2018-11-14 16:44:03,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {21969#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} is VALID [2018-11-14 16:44:03,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {21865#true} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {21973#(bvslt (bvadd main_~main__i~0 (_ bv1 32)) main_~main__len~0)} is VALID [2018-11-14 16:44:03,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {21865#true} assume ~bvslt32(~main__j~0, ~main__limit~0); {21865#true} is VALID [2018-11-14 16:44:03,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {21865#true} assume ~bvslt32(~main__i~0, ~main__len~0); {21865#true} is VALID [2018-11-14 16:44:03,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {21865#true} is VALID [2018-11-14 16:44:03,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21865#true} is VALID [2018-11-14 16:44:03,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21865#true} is VALID [2018-11-14 16:44:03,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {21865#true} is VALID [2018-11-14 16:44:03,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {21865#true} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {21865#true} is VALID [2018-11-14 16:44:03,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {21865#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {21865#true} is VALID [2018-11-14 16:44:03,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {21865#true} is VALID [2018-11-14 16:44:03,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {21865#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {21865#true} is VALID [2018-11-14 16:44:03,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {21865#true} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {21865#true} is VALID [2018-11-14 16:44:03,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {21865#true} assume ~bvslt32(~main__j~0, ~main__limit~0); {21865#true} is VALID [2018-11-14 16:44:03,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {21865#true} assume ~bvslt32(~main__i~0, ~main__len~0); {21865#true} is VALID [2018-11-14 16:44:03,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {21865#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {21865#true} is VALID [2018-11-14 16:44:03,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {21865#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {21865#true} is VALID [2018-11-14 16:44:03,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {21865#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {21865#true} is VALID [2018-11-14 16:44:03,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {21865#true} call #t~ret4 := main(); {21865#true} is VALID [2018-11-14 16:44:03,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21865#true} {21865#true} #139#return; {21865#true} is VALID [2018-11-14 16:44:03,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {21865#true} assume true; {21865#true} is VALID [2018-11-14 16:44:03,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {21865#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {21865#true} is VALID [2018-11-14 16:44:03,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {21865#true} call ULTIMATE.init(); {21865#true} is VALID [2018-11-14 16:44:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:44:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:44:03,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-14 16:44:03,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-14 16:44:03,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:03,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:44:03,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:03,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:44:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:44:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:03,480 INFO L87 Difference]: Start difference. First operand 191 states and 230 transitions. Second operand 10 states. [2018-11-14 16:44:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,066 INFO L93 Difference]: Finished difference Result 244 states and 286 transitions. [2018-11-14 16:44:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:44:05,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-14 16:44:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-14 16:44:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-14 16:44:05,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 119 transitions. [2018-11-14 16:44:05,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:05,271 INFO L225 Difference]: With dead ends: 244 [2018-11-14 16:44:05,272 INFO L226 Difference]: Without dead ends: 242 [2018-11-14 16:44:05,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-14 16:44:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 189. [2018-11-14 16:44:06,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:06,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand 189 states. [2018-11-14 16:44:06,003 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 189 states. [2018-11-14 16:44:06,003 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 189 states. [2018-11-14 16:44:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:06,008 INFO L93 Difference]: Finished difference Result 242 states and 281 transitions. [2018-11-14 16:44:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 281 transitions. [2018-11-14 16:44:06,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:06,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:06,009 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 242 states. [2018-11-14 16:44:06,009 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 242 states. [2018-11-14 16:44:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:06,014 INFO L93 Difference]: Finished difference Result 242 states and 281 transitions. [2018-11-14 16:44:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 281 transitions. [2018-11-14 16:44:06,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:06,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:06,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:06,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-14 16:44:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 225 transitions. [2018-11-14 16:44:06,019 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 225 transitions. Word has length 31 [2018-11-14 16:44:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:06,019 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 225 transitions. [2018-11-14 16:44:06,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:44:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 225 transitions. [2018-11-14 16:44:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:44:06,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:06,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:06,020 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:06,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1698217693, now seen corresponding path program 1 times [2018-11-14 16:44:06,021 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:06,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:06,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {23059#true} call ULTIMATE.init(); {23059#true} is VALID [2018-11-14 16:44:06,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {23059#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {23059#true} is VALID [2018-11-14 16:44:06,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {23059#true} assume true; {23059#true} is VALID [2018-11-14 16:44:06,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23059#true} {23059#true} #139#return; {23059#true} is VALID [2018-11-14 16:44:06,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {23059#true} call #t~ret4 := main(); {23059#true} is VALID [2018-11-14 16:44:06,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {23059#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {23059#true} is VALID [2018-11-14 16:44:06,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {23059#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {23082#(= (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {23082#(= (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23119#(= (_ bv1 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {23119#(= (_ bv1 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {23150#(= (_ bv2 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {23150#(= (_ bv2 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {23154#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:06,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {23154#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {23060#false} is VALID [2018-11-14 16:44:06,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {23060#false} assume !false; {23060#false} is VALID [2018-11-14 16:44:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:06,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:06,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {23060#false} assume !false; {23060#false} is VALID [2018-11-14 16:44:06,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {23164#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {23060#false} is VALID [2018-11-14 16:44:06,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {23168#(bvsle (_ bv0 32) main_~main__i~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {23164#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-14 16:44:06,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {23168#(bvsle (_ bv0 32) main_~main__i~0)} is VALID [2018-11-14 16:44:06,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,479 INFO L273 TraceCheckUtils]: 20: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {23172#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:06,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {23059#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {23203#(bvsle (_ bv0 32) (bvadd main_~main__i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:06,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {23059#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {23059#true} is VALID [2018-11-14 16:44:06,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {23059#true} call #t~ret4 := main(); {23059#true} is VALID [2018-11-14 16:44:06,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23059#true} {23059#true} #139#return; {23059#true} is VALID [2018-11-14 16:44:06,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {23059#true} assume true; {23059#true} is VALID [2018-11-14 16:44:06,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {23059#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {23059#true} is VALID [2018-11-14 16:44:06,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {23059#true} call ULTIMATE.init(); {23059#true} is VALID [2018-11-14 16:44:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 16:44:06,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:44:06,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:06,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:44:06,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:06,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:44:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:44:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:06,718 INFO L87 Difference]: Start difference. First operand 189 states and 225 transitions. Second operand 10 states. [2018-11-14 16:44:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:09,371 INFO L93 Difference]: Finished difference Result 376 states and 430 transitions. [2018-11-14 16:44:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:44:09,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:44:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2018-11-14 16:44:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2018-11-14 16:44:09,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 198 transitions. [2018-11-14 16:44:09,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:09,704 INFO L225 Difference]: With dead ends: 376 [2018-11-14 16:44:09,705 INFO L226 Difference]: Without dead ends: 374 [2018-11-14 16:44:09,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:44:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-14 16:44:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 181. [2018-11-14 16:44:10,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:10,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand 181 states. [2018-11-14 16:44:10,219 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand 181 states. [2018-11-14 16:44:10,219 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 181 states. [2018-11-14 16:44:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:10,228 INFO L93 Difference]: Finished difference Result 374 states and 423 transitions. [2018-11-14 16:44:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 423 transitions. [2018-11-14 16:44:10,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:10,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:10,229 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 374 states. [2018-11-14 16:44:10,229 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 374 states. [2018-11-14 16:44:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:10,237 INFO L93 Difference]: Finished difference Result 374 states and 423 transitions. [2018-11-14 16:44:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 423 transitions. [2018-11-14 16:44:10,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:10,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:10,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:10,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-14 16:44:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2018-11-14 16:44:10,242 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 32 [2018-11-14 16:44:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:10,242 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2018-11-14 16:44:10,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:44:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2018-11-14 16:44:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:44:10,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:10,243 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-14 16:44:10,243 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:10,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1105137786, now seen corresponding path program 1 times [2018-11-14 16:44:10,244 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:10,244 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:10,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:10,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {24684#true} call ULTIMATE.init(); {24684#true} is VALID [2018-11-14 16:44:10,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {24684#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {24684#true} is VALID [2018-11-14 16:44:10,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {24684#true} assume true; {24684#true} is VALID [2018-11-14 16:44:10,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24684#true} {24684#true} #139#return; {24684#true} is VALID [2018-11-14 16:44:10,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {24684#true} call #t~ret4 := main(); {24684#true} is VALID [2018-11-14 16:44:10,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {24684#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {24684#true} is VALID [2018-11-14 16:44:10,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {24684#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {24707#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:44:10,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {24707#(and (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {24711#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:44:10,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {24711#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0); {24711#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} is VALID [2018-11-14 16:44:10,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {24711#(and (= (_ bv0 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (= (bvadd main_~main__limit~0 (_ bv4 32)) main_~main__bufsize~0))} assume ~bvslt32(~main__j~0, ~main__limit~0); {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} is VALID [2018-11-14 16:44:10,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {24718#(and (= (_ bv0 32) main_~main__j~0) (bvslt main_~main__j~0 (bvadd main_~main__bufsize~0 (_ bv4294967292 32))) (not (bvslt main_~main__bufsize~0 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__i~0, ~main__len~0); {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~main__j~0, ~main__limit~0); {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {24746#(and (= (_ bv1 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {24777#(and (= (_ bv2 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {24777#(and (= (_ bv2 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {24777#(and (= (_ bv2 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} is VALID [2018-11-14 16:44:10,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {24777#(and (= (_ bv2 32) main_~main__j~0) (not (bvslt main_~main__bufsize~0 (_ bv0 32))) (bvslt (_ bv0 32) (bvadd main_~main__bufsize~0 (_ bv4294967292 32))))} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {24784#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:10,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {24784#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {24685#false} is VALID [2018-11-14 16:44:10,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {24685#false} assume !false; {24685#false} is VALID [2018-11-14 16:44:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:10,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:10,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {24685#false} assume !false; {24685#false} is VALID [2018-11-14 16:44:10,915 INFO L273 TraceCheckUtils]: 31: Hoare triple {24794#(not (= main_~__VERIFIER_assert__cond~12 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {24685#false} is VALID [2018-11-14 16:44:10,915 INFO L273 TraceCheckUtils]: 30: Hoare triple {24798#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {24794#(not (= main_~__VERIFIER_assert__cond~12 (_ bv0 32)))} is VALID [2018-11-14 16:44:10,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {24798#(bvslt main_~main__j~0 main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {24798#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {24798#(bvslt main_~main__j~0 main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {24805#(bvslt (bvadd main_~main__j~0 (_ bv1 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {24864#(or (bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0) (not (bvslt main_~main__j~0 main_~main__limit~0)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {24836#(bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0)} is VALID [2018-11-14 16:44:10,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {24864#(or (bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0) (not (bvslt main_~main__j~0 main_~main__limit~0)))} assume ~bvslt32(~main__i~0, ~main__len~0); {24864#(or (bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0) (not (bvslt main_~main__j~0 main_~main__limit~0)))} is VALID [2018-11-14 16:44:10,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {24871#(or (not (bvslt (_ bv0 32) main_~main__limit~0)) (bvslt (_ bv2 32) main_~main__bufsize~0))} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {24864#(or (bvslt (bvadd main_~main__j~0 (_ bv2 32)) main_~main__bufsize~0) (not (bvslt main_~main__j~0 main_~main__limit~0)))} is VALID [2018-11-14 16:44:10,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {24684#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {24871#(or (not (bvslt (_ bv0 32) main_~main__limit~0)) (bvslt (_ bv2 32) main_~main__bufsize~0))} is VALID [2018-11-14 16:44:10,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {24684#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {24684#true} is VALID [2018-11-14 16:44:10,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {24684#true} call #t~ret4 := main(); {24684#true} is VALID [2018-11-14 16:44:10,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24684#true} {24684#true} #139#return; {24684#true} is VALID [2018-11-14 16:44:10,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {24684#true} assume true; {24684#true} is VALID [2018-11-14 16:44:10,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {24684#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {24684#true} is VALID [2018-11-14 16:44:10,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {24684#true} call ULTIMATE.init(); {24684#true} is VALID [2018-11-14 16:44:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:10,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:10,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:44:10,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 16:44:10,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:10,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:44:11,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:11,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:44:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:44:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:44:11,086 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 14 states. [2018-11-14 16:44:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,574 INFO L93 Difference]: Finished difference Result 467 states and 542 transitions. [2018-11-14 16:44:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:44:18,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 16:44:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 269 transitions. [2018-11-14 16:44:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 269 transitions. [2018-11-14 16:44:18,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 269 transitions. [2018-11-14 16:44:19,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:19,540 INFO L225 Difference]: With dead ends: 467 [2018-11-14 16:44:19,540 INFO L226 Difference]: Without dead ends: 352 [2018-11-14 16:44:19,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:44:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-14 16:44:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 201. [2018-11-14 16:44:20,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:20,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand 201 states. [2018-11-14 16:44:20,065 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 201 states. [2018-11-14 16:44:20,065 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 201 states. [2018-11-14 16:44:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,071 INFO L93 Difference]: Finished difference Result 352 states and 401 transitions. [2018-11-14 16:44:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 401 transitions. [2018-11-14 16:44:20,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,072 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 352 states. [2018-11-14 16:44:20,072 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 352 states. [2018-11-14 16:44:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,078 INFO L93 Difference]: Finished difference Result 352 states and 401 transitions. [2018-11-14 16:44:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 401 transitions. [2018-11-14 16:44:20,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:20,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-14 16:44:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2018-11-14 16:44:20,082 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 33 [2018-11-14 16:44:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:20,082 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2018-11-14 16:44:20,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:44:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2018-11-14 16:44:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:44:20,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:20,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-14 16:44:20,084 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:20,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash 100470153, now seen corresponding path program 1 times [2018-11-14 16:44:20,084 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:20,084 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:20,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:20,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {26419#true} call ULTIMATE.init(); {26419#true} is VALID [2018-11-14 16:44:20,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {26419#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {26419#true} is VALID [2018-11-14 16:44:20,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {26419#true} assume true; {26419#true} is VALID [2018-11-14 16:44:20,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26419#true} {26419#true} #139#return; {26419#true} is VALID [2018-11-14 16:44:20,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {26419#true} call #t~ret4 := main(); {26419#true} is VALID [2018-11-14 16:44:20,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {26419#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {26419#true} is VALID [2018-11-14 16:44:20,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {26419#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {26419#true} is VALID [2018-11-14 16:44:20,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {26419#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {26445#(= (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {26445#(= (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__i~0, ~main__len~0); {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~main__j~0, ~main__limit~0); {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {26479#(= (_ bv1 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {26479#(= (_ bv1 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26510#(= (_ bv2 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {26510#(= (_ bv2 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26510#(= (_ bv2 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {26510#(= (_ bv2 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26510#(= (_ bv2 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {26510#(= (_ bv2 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26520#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {26520#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {26420#false} is VALID [2018-11-14 16:44:20,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {26420#false} assume !false; {26420#false} is VALID [2018-11-14 16:44:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:20,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:20,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {26420#false} assume !false; {26420#false} is VALID [2018-11-14 16:44:20,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {26530#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {26420#false} is VALID [2018-11-14 16:44:20,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {26534#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26530#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} is VALID [2018-11-14 16:44:20,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {26534#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26534#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {26534#(bvsle (_ bv0 32) main_~main__j~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26534#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~9 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26534#(bvsle (_ bv0 32) main_~main__j~0)} is VALID [2018-11-14 16:44:20,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,420 INFO L273 TraceCheckUtils]: 21: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32);~main____CPAchecker_TMP_6~0 := ~main__j~0;~main__j~0 := ~bvadd32(1bv32, ~main__j~0);~main____CPAchecker_TMP_7~0 := ~main__i~0;~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {26544#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv1 32)))} is VALID [2018-11-14 16:44:20,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__j~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__j~0, ~main__bufsize~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__i~0, ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32); {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~main__i~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__i~0), ~main__len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume ~bvslt32(~main__j~0, ~main__limit~0); {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} assume ~bvslt32(~main__i~0, ~main__len~0); {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {26419#true} assume ~bvslt32(~main__i~0, ~main__len~0);~main__j~0 := 0bv32; {26575#(bvsle (_ bv0 32) (bvadd main_~main__j~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:20,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {26419#true} assume !~bvslt32(~main__bufsize~0, 0bv32);~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~bvsub32(~main__bufsize~0, 4bv32);~main__i~0 := 0bv32; {26419#true} is VALID [2018-11-14 16:44:20,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {26419#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {26419#true} is VALID [2018-11-14 16:44:20,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {26419#true} call #t~ret4 := main(); {26419#true} is VALID [2018-11-14 16:44:20,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26419#true} {26419#true} #139#return; {26419#true} is VALID [2018-11-14 16:44:20,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {26419#true} assume true; {26419#true} is VALID [2018-11-14 16:44:20,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {26419#true} ~__return_main~0 := 0bv32;~__return_334~0 := 0bv32; {26419#true} is VALID [2018-11-14 16:44:20,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {26419#true} call ULTIMATE.init(); {26419#true} is VALID [2018-11-14 16:44:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:20,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:20,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 16:44:20,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-14 16:44:20,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:20,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:44:20,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:20,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:44:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:44:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:20,523 INFO L87 Difference]: Start difference. First operand 201 states and 240 transitions. Second operand 10 states. [2018-11-14 16:44:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,993 INFO L93 Difference]: Finished difference Result 636 states and 721 transitions. [2018-11-14 16:44:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:44:24,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-14 16:44:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 494 transitions. [2018-11-14 16:44:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:44:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 494 transitions. [2018-11-14 16:44:24,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 494 transitions. [2018-11-14 16:44:25,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:25,788 INFO L225 Difference]: With dead ends: 636 [2018-11-14 16:44:25,788 INFO L226 Difference]: Without dead ends: 634 [2018-11-14 16:44:25,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:44:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-14 16:44:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 238. [2018-11-14 16:44:26,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:26,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand 238 states. [2018-11-14 16:44:26,340 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand 238 states. [2018-11-14 16:44:26,340 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 238 states. [2018-11-14 16:44:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:26,356 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2018-11-14 16:44:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 715 transitions. [2018-11-14 16:44:26,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:26,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:26,357 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 634 states. [2018-11-14 16:44:26,357 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 634 states. [2018-11-14 16:44:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:26,378 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2018-11-14 16:44:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 715 transitions. [2018-11-14 16:44:26,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:26,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:26,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:26,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-14 16:44:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 289 transitions. [2018-11-14 16:44:26,384 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 289 transitions. Word has length 34 [2018-11-14 16:44:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:26,385 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 289 transitions. [2018-11-14 16:44:26,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:44:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 289 transitions. [2018-11-14 16:44:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:44:26,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:26,385 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-14 16:44:26,386 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:26,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1180389396, now seen corresponding path program 1 times [2018-11-14 16:44:26,386 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:26,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY