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_Default-Const.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 19:21:36,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:21:36,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:21:36,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:21:36,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:21:36,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:21:36,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:21:36,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:21:36,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:21:36,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:21:36,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:21:36,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:21:36,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:21:36,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:21:36,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:21:36,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:21:36,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:21:36,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:21:36,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:21:36,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:21:36,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:21:36,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:21:36,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:21:36,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:21:36,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:21:36,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:21:36,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:21:36,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:21:36,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:21:36,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:21:36,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:21:36,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:21:36,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:21:36,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:21:36,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:21:36,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:21:36,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:21:36,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:21:36,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:21:36,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:21:36,470 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:21:36,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:21:36,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:21:36,471 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:21:36,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:21:36,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:21:36,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:21:36,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:21:36,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:21:36,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:21:36,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:21:36,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:21:36,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:21:36,473 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:21:36,473 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:21:36,473 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:21:36,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:21:36,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:21:36,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:21:36,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:21:36,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:21:36,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:21:36,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:21:36,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:21:36,475 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:21:36,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:21:36,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:21:36,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:21:36,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:21:36,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:21:36,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:21:36,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:21:36,539 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:21:36,540 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 19:21:36,604 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393d3170f/0119d68ccac84124be77f12af03033df/FLAGdaaef4577 [2018-11-14 19:21:37,032 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:21:37,033 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 19:21:37,042 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393d3170f/0119d68ccac84124be77f12af03033df/FLAGdaaef4577 [2018-11-14 19:21:37,059 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393d3170f/0119d68ccac84124be77f12af03033df [2018-11-14 19:21:37,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:21:37,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:21:37,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:21:37,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:21:37,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:21:37,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2543e827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37, skipping insertion in model container [2018-11-14 19:21:37,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:21:37,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:21:37,395 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:21:37,408 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:21:37,460 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:21:37,475 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:21:37,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37 WrapperNode [2018-11-14 19:21:37,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:21:37,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:21:37,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:21:37,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:21:37,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (1/1) ... [2018-11-14 19:21:37,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:21:37,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:21:37,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:21:37,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:21:37,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (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 19:21:37,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:21:37,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:21:37,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:21:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:21:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:21:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:21:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:21:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:21:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:21:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:21:38,753 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:21:38,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:21:38 BoogieIcfgContainer [2018-11-14 19:21:38,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:21:38,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:21:38,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:21:38,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:21:38,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:21:37" (1/3) ... [2018-11-14 19:21:38,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5444915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:21:38, skipping insertion in model container [2018-11-14 19:21:38,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:21:37" (2/3) ... [2018-11-14 19:21:38,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5444915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:21:38, skipping insertion in model container [2018-11-14 19:21:38,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:21:38" (3/3) ... [2018-11-14 19:21:38,763 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 19:21:38,773 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:21:38,785 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 19:21:38,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 19:21:38,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:21:38,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:21:38,833 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:21:38,833 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:21:38,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:21:38,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:21:38,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:21:38,834 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:21:38,834 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:21:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-14 19:21:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:21:38,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:38,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:38,877 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:38,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-11-14 19:21:38,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:38,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:38,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:39,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-14 19:21:39,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} ~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2018-11-14 19:21:39,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 19:21:39,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #139#return; {68#true} is VALID [2018-11-14 19:21:39,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret4 := main(); {68#true} is VALID [2018-11-14 19:21:39,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {68#true} is VALID [2018-11-14 19:21:39,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {68#true} is VALID [2018-11-14 19:21:39,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {68#true} is VALID [2018-11-14 19:21:39,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2018-11-14 19:21:39,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2018-11-14 19:21:39,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {68#true} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {70#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:21:39,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {70#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {69#false} is VALID [2018-11-14 19:21:39,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-14 19:21:39,110 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 19:21:39,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:39,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:21:39,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:21:39,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:39,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:21:39,204 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 19:21:39,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:21:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:21:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:21:39,215 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-11-14 19:21:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:39,607 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-11-14 19:21:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:21:39,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:21:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:21:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-14 19:21:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:21:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-14 19:21:39,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-14 19:21:40,380 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 19:21:40,405 INFO L225 Difference]: With dead ends: 88 [2018-11-14 19:21:40,405 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 19:21:40,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:21:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 19:21:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-14 19:21:40,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:40,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2018-11-14 19:21:40,473 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2018-11-14 19:21:40,474 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2018-11-14 19:21:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:40,482 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-14 19:21:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-14 19:21:40,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:40,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:40,484 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2018-11-14 19:21:40,484 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2018-11-14 19:21:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:40,491 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-14 19:21:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-14 19:21:40,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:40,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:40,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:40,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 19:21:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-14 19:21:40,499 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-11-14 19:21:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:40,500 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-14 19:21:40,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:21:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-14 19:21:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:21:40,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:40,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:40,502 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:40,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-11-14 19:21:40,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:40,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:40,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:40,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:40,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2018-11-14 19:21:40,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {389#true} ~__return_main~0 := 0;~__return_334~0 := 0; {389#true} is VALID [2018-11-14 19:21:40,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2018-11-14 19:21:40,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #139#return; {389#true} is VALID [2018-11-14 19:21:40,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {389#true} call #t~ret4 := main(); {389#true} is VALID [2018-11-14 19:21:40,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {389#true} is VALID [2018-11-14 19:21:40,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {389#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {389#true} is VALID [2018-11-14 19:21:40,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:40,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:40,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:40,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} assume !(~main__i~0 + 1 < ~main__len~0); {391#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:40,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#(< main_~main__i~0 main_~main__len~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {392#(= main_~__VERIFIER_assert__cond~2 1)} is VALID [2018-11-14 19:21:40,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {392#(= main_~__VERIFIER_assert__cond~2 1)} assume ~__VERIFIER_assert__cond~2 == 0; {390#false} is VALID [2018-11-14 19:21:40,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#false} assume !false; {390#false} is VALID [2018-11-14 19:21:40,644 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 19:21:40,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:40,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:21:40,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 19:21:40,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:40,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:21:40,684 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 19:21:40,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:21:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:21:40,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:21:40,685 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-14 19:21:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:41,303 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-14 19:21:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:21:41,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 19:21:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:21:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-14 19:21:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:21:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2018-11-14 19:21:41,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 168 transitions. [2018-11-14 19:21:41,558 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 19:21:41,563 INFO L225 Difference]: With dead ends: 153 [2018-11-14 19:21:41,563 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 19:21:41,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:21:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 19:21:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-11-14 19:21:41,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:41,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2018-11-14 19:21:41,599 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2018-11-14 19:21:41,599 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2018-11-14 19:21:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:41,605 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-14 19:21:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-14 19:21:41,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:41,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:41,608 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2018-11-14 19:21:41,608 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2018-11-14 19:21:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:41,614 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-14 19:21:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-11-14 19:21:41,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:41,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:41,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:41,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 19:21:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-14 19:21:41,624 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-11-14 19:21:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:41,625 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-14 19:21:41,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:21:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 19:21:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:21:41,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:41,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:41,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:41,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-11-14 19:21:41,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:41,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:41,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-14 19:21:41,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} ~__return_main~0 := 0;~__return_334~0 := 0; {835#true} is VALID [2018-11-14 19:21:41,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-14 19:21:41,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #139#return; {835#true} is VALID [2018-11-14 19:21:41,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret4 := main(); {835#true} is VALID [2018-11-14 19:21:41,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {835#true} is VALID [2018-11-14 19:21:41,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {835#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:41,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:41,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:41,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {837#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:41,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {837#(<= 0 main_~main__i~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {838#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:41,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {838#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {839#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 19:21:41,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {839#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {836#false} is VALID [2018-11-14 19:21:41,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-14 19:21:41,780 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 19:21:41,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:21:41,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:21:41,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:41,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:21:41,801 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 19:21:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:21:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:21:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:41,802 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2018-11-14 19:21:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:42,158 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-14 19:21:42,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:21:42,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:21:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 19:21:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 19:21:42,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-14 19:21:42,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:42,365 INFO L225 Difference]: With dead ends: 75 [2018-11-14 19:21:42,366 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 19:21:42,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 19:21:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-14 19:21:42,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:42,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2018-11-14 19:21:42,446 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2018-11-14 19:21:42,446 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2018-11-14 19:21:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:42,449 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-14 19:21:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-14 19:21:42,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:42,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:42,451 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2018-11-14 19:21:42,451 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2018-11-14 19:21:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:42,455 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-14 19:21:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-14 19:21:42,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:42,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:42,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:42,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 19:21:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 19:21:42,459 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2018-11-14 19:21:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:42,460 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 19:21:42,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:21:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 19:21:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:21:42,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:42,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:42,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:42,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-11-14 19:21:42,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:42,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:42,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:42,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2018-11-14 19:21:42,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {1141#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1141#true} is VALID [2018-11-14 19:21:42,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2018-11-14 19:21:42,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #139#return; {1141#true} is VALID [2018-11-14 19:21:42,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret4 := main(); {1141#true} is VALID [2018-11-14 19:21:42,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1141#true} is VALID [2018-11-14 19:21:42,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {1141#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1143#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:42,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {1143#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-14 19:21:42,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-14 19:21:42,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-14 19:21:42,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} assume !(~main__i~0 + 1 < ~main__len~0); {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} is VALID [2018-11-14 19:21:42,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {1144#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1145#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~2 1))} is VALID [2018-11-14 19:21:42,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {1145#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~2 1))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1146#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-14 19:21:42,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {1146#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume ~__VERIFIER_assert__cond~3 == 0; {1142#false} is VALID [2018-11-14 19:21:42,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2018-11-14 19:21:42,605 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 19:21:42,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:42,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:42,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:21:42,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:42,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:42,622 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 19:21:42,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:42,624 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-11-14 19:21:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:43,316 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-14 19:21:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:21:43,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:21:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-14 19:21:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-14 19:21:43,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2018-11-14 19:21:43,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:43,507 INFO L225 Difference]: With dead ends: 98 [2018-11-14 19:21:43,507 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 19:21:43,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:21:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 19:21:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-11-14 19:21:43,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:43,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 54 states. [2018-11-14 19:21:43,562 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 54 states. [2018-11-14 19:21:43,562 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 54 states. [2018-11-14 19:21:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:43,566 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-14 19:21:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-14 19:21:43,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:43,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:43,567 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 96 states. [2018-11-14 19:21:43,567 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 96 states. [2018-11-14 19:21:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:43,571 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-14 19:21:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-14 19:21:43,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:43,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:43,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:43,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:21:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-14 19:21:43,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-11-14 19:21:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:43,575 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-14 19:21:43,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 19:21:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:21:43,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:43,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:43,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:43,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-11-14 19:21:43,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:43,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:43,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-14 19:21:43,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1521#true} is VALID [2018-11-14 19:21:43,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-14 19:21:43,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #139#return; {1521#true} is VALID [2018-11-14 19:21:43,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret4 := main(); {1521#true} is VALID [2018-11-14 19:21:43,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1521#true} is VALID [2018-11-14 19:21:43,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1523#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:43,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} is VALID [2018-11-14 19:21:43,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} assume ~main__i~0 < ~main__len~0; {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} is VALID [2018-11-14 19:21:43,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {1524#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))} assume ~main__j~0 < ~main__limit~0; {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} is VALID [2018-11-14 19:21:43,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} assume !(~main__i~0 + 1 < ~main__len~0); {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} is VALID [2018-11-14 19:21:43,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {1525#(and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1526#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~2 1))} is VALID [2018-11-14 19:21:43,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {1526#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~2 1))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1527#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:43,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {1527#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~3 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1528#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-14 19:21:43,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {1528#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {1522#false} is VALID [2018-11-14 19:21:43,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-14 19:21:43,780 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 19:21:43,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:43,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:21:43,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-14 19:21:43,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:43,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:21:43,801 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 19:21:43,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:21:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:21:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:21:43,802 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-11-14 19:21:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:45,136 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-14 19:21:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:21:45,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-14 19:21:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:21:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-14 19:21:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:21:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-14 19:21:45,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-14 19:21:45,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:45,333 INFO L225 Difference]: With dead ends: 97 [2018-11-14 19:21:45,333 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 19:21:45,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:21:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 19:21:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-11-14 19:21:45,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:45,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 52 states. [2018-11-14 19:21:45,384 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 52 states. [2018-11-14 19:21:45,384 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 52 states. [2018-11-14 19:21:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:45,387 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-14 19:21:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-14 19:21:45,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:45,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:45,389 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 95 states. [2018-11-14 19:21:45,389 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 95 states. [2018-11-14 19:21:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:45,392 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-14 19:21:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-14 19:21:45,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:45,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:45,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:45,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:21:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-14 19:21:45,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-11-14 19:21:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:45,396 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-14 19:21:45,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:21:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 19:21:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:21:45,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:45,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:45,398 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:45,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-11-14 19:21:45,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:45,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:45,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2018-11-14 19:21:45,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {1904#true} ~__return_main~0 := 0;~__return_334~0 := 0; {1904#true} is VALID [2018-11-14 19:21:45,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {1904#true} assume true; {1904#true} is VALID [2018-11-14 19:21:45,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1904#true} {1904#true} #139#return; {1904#true} is VALID [2018-11-14 19:21:45,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {1904#true} call #t~ret4 := main(); {1904#true} is VALID [2018-11-14 19:21:45,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {1904#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {1904#true} is VALID [2018-11-14 19:21:45,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1904#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1904#true} is VALID [2018-11-14 19:21:45,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {1904#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:45,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:45,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:45,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1907#(and (< main_~main__i~0 main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:45,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1907#(and (< main_~main__i~0 main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:45,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {1906#(< main_~main__i~0 main_~main__len~0)} is VALID [2018-11-14 19:21:45,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1906#(< main_~main__i~0 main_~main__len~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {1908#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-14 19:21:45,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {1908#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume ~__VERIFIER_assert__cond~6 == 0; {1905#false} is VALID [2018-11-14 19:21:45,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2018-11-14 19:21:45,540 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 19:21:45,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:45,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:21:45,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 19:21:45,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:45,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:21:45,563 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 19:21:45,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:21:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:21:45,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:45,564 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-11-14 19:21:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:45,977 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-14 19:21:45,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:21:45,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 19:21:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-14 19:21:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-14 19:21:45,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2018-11-14 19:21:46,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:46,084 INFO L225 Difference]: With dead ends: 83 [2018-11-14 19:21:46,084 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 19:21:46,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:21:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 19:21:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2018-11-14 19:21:46,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:46,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 50 states. [2018-11-14 19:21:46,278 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 50 states. [2018-11-14 19:21:46,278 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 50 states. [2018-11-14 19:21:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:46,281 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-14 19:21:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-14 19:21:46,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:46,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:46,282 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 81 states. [2018-11-14 19:21:46,282 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 81 states. [2018-11-14 19:21:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:46,284 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-14 19:21:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-14 19:21:46,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:46,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:46,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:46,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 19:21:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 19:21:46,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-14 19:21:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:46,288 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 19:21:46,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:21:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 19:21:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:21:46,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:46,289 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 19:21:46,289 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:46,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-11-14 19:21:46,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:46,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2234#true} is VALID [2018-11-14 19:21:46,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {2234#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2234#true} is VALID [2018-11-14 19:21:46,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {2234#true} assume true; {2234#true} is VALID [2018-11-14 19:21:46,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} #139#return; {2234#true} is VALID [2018-11-14 19:21:46,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {2234#true} call #t~ret4 := main(); {2234#true} is VALID [2018-11-14 19:21:46,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {2234#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2234#true} is VALID [2018-11-14 19:21:46,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {2234#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2234#true} is VALID [2018-11-14 19:21:46,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {2234#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:46,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume ~main__i~0 < ~main__len~0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:46,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume ~main__j~0 < ~main__limit~0; {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:46,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} assume !(~main__i~0 + 1 < ~main__len~0); {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:46,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {2236#(and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2237#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:46,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {2237#(and (= main_~__VERIFIER_assert__cond~2 1) (<= 0 main_~main__j~0))} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2238#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:46,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {2238#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~3 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2238#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:46,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {2238#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~4 == 0);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2239#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-14 19:21:46,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {2239#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume ~__VERIFIER_assert__cond~5 == 0; {2235#false} is VALID [2018-11-14 19:21:46,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2018-11-14 19:21:46,430 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 19:21:46,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:46,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:46,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:21:46,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:46,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:46,587 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 19:21:46,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:46,588 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-11-14 19:21:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:47,413 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-14 19:21:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:21:47,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:21:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 19:21:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 19:21:47,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2018-11-14 19:21:47,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:47,545 INFO L225 Difference]: With dead ends: 93 [2018-11-14 19:21:47,546 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 19:21:47,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:21:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 19:21:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2018-11-14 19:21:47,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:47,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 48 states. [2018-11-14 19:21:47,586 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 48 states. [2018-11-14 19:21:47,586 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 48 states. [2018-11-14 19:21:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:47,591 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-14 19:21:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-14 19:21:47,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:47,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:47,592 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 91 states. [2018-11-14 19:21:47,592 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 91 states. [2018-11-14 19:21:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:47,595 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-14 19:21:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-14 19:21:47,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:47,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:47,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:47,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:21:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-14 19:21:47,598 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2018-11-14 19:21:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:47,598 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-14 19:21:47,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-14 19:21:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:21:47,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:47,599 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 19:21:47,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:47,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-11-14 19:21:47,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:47,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:47,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:47,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {2594#true} call ULTIMATE.init(); {2594#true} is VALID [2018-11-14 19:21:47,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {2594#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2594#true} is VALID [2018-11-14 19:21:47,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {2594#true} assume true; {2594#true} is VALID [2018-11-14 19:21:47,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2594#true} {2594#true} #139#return; {2594#true} is VALID [2018-11-14 19:21:47,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {2594#true} call #t~ret4 := main(); {2594#true} is VALID [2018-11-14 19:21:47,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {2594#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2594#true} is VALID [2018-11-14 19:21:47,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {2594#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2594#true} is VALID [2018-11-14 19:21:47,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {2594#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2594#true} is VALID [2018-11-14 19:21:47,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {2594#true} assume ~main__i~0 < ~main__len~0; {2594#true} is VALID [2018-11-14 19:21:47,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {2594#true} assume ~main__j~0 < ~main__limit~0; {2594#true} is VALID [2018-11-14 19:21:47,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {2594#true} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2594#true} is VALID [2018-11-14 19:21:47,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {2594#true} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2596#(or (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~1 1)) (and (< main_~main__i~0 0) (= main_~__VERIFIER_assert__cond~1 0)))} is VALID [2018-11-14 19:21:47,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {2596#(or (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~1 1)) (and (< main_~main__i~0 0) (= main_~__VERIFIER_assert__cond~1 0)))} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2597#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:47,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {2597#(<= 0 main_~main__i~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2597#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:47,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {2597#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2598#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-14 19:21:47,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {2598#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume ~__VERIFIER_assert__cond~7 == 0; {2595#false} is VALID [2018-11-14 19:21:47,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {2595#false} assume !false; {2595#false} is VALID [2018-11-14 19:21:47,728 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 19:21:47,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:47,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:21:47,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:21:47,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:47,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:21:47,797 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 19:21:47,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:21:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:21:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:47,798 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-11-14 19:21:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:48,189 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-14 19:21:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:21:48,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:21:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-14 19:21:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-14 19:21:48,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2018-11-14 19:21:48,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:48,279 INFO L225 Difference]: With dead ends: 73 [2018-11-14 19:21:48,279 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 19:21:48,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:21:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 19:21:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-11-14 19:21:48,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:48,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 46 states. [2018-11-14 19:21:48,335 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 46 states. [2018-11-14 19:21:48,335 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 46 states. [2018-11-14 19:21:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:48,339 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-14 19:21:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2018-11-14 19:21:48,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:48,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:48,340 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 71 states. [2018-11-14 19:21:48,340 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 71 states. [2018-11-14 19:21:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:48,343 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-14 19:21:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2018-11-14 19:21:48,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:48,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:48,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:48,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 19:21:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-14 19:21:48,345 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2018-11-14 19:21:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:48,346 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-14 19:21:48,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:21:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 19:21:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:21:48,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:48,347 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 19:21:48,347 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:48,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-11-14 19:21:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:48,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:48,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {2892#true} call ULTIMATE.init(); {2892#true} is VALID [2018-11-14 19:21:48,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {2892#true} ~__return_main~0 := 0;~__return_334~0 := 0; {2892#true} is VALID [2018-11-14 19:21:48,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {2892#true} assume true; {2892#true} is VALID [2018-11-14 19:21:48,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2892#true} {2892#true} #139#return; {2892#true} is VALID [2018-11-14 19:21:48,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {2892#true} call #t~ret4 := main(); {2892#true} is VALID [2018-11-14 19:21:48,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {2892#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {2892#true} is VALID [2018-11-14 19:21:48,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {2892#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2896#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:48,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {2896#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:48,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {2895#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {2897#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-14 19:21:48,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {2897#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume ~__VERIFIER_assert__cond~8 == 0; {2893#false} is VALID [2018-11-14 19:21:48,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {2893#false} assume !false; {2893#false} is VALID [2018-11-14 19:21:48,515 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 19:21:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:48,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:21:48,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:48,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:48,569 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 19:21:48,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:48,570 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-14 19:21:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:49,246 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-14 19:21:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:21:49,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 19:21:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2018-11-14 19:21:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2018-11-14 19:21:49,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2018-11-14 19:21:49,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:49,429 INFO L225 Difference]: With dead ends: 71 [2018-11-14 19:21:49,429 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 19:21:49,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:21:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 19:21:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-11-14 19:21:49,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:49,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 44 states. [2018-11-14 19:21:49,941 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 44 states. [2018-11-14 19:21:49,941 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 44 states. [2018-11-14 19:21:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:49,945 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-14 19:21:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-14 19:21:49,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:49,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:49,946 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 69 states. [2018-11-14 19:21:49,946 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 69 states. [2018-11-14 19:21:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:49,948 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-14 19:21:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-14 19:21:49,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:49,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:49,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:49,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:21:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-14 19:21:49,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2018-11-14 19:21:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:49,950 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-14 19:21:49,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 19:21:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:21:49,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:49,951 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 19:21:49,952 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:49,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-11-14 19:21:49,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:49,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:49,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:50,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2018-11-14 19:21:50,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {3185#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3185#true} is VALID [2018-11-14 19:21:50,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 19:21:50,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3185#true} {3185#true} #139#return; {3185#true} is VALID [2018-11-14 19:21:50,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {3185#true} call #t~ret4 := main(); {3185#true} is VALID [2018-11-14 19:21:50,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {3185#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3185#true} is VALID [2018-11-14 19:21:50,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3185#true} is VALID [2018-11-14 19:21:50,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {3187#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {3187#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 0 main_~main__j~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3188#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:50,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {3188#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3187#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:50,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {3187#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3189#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-14 19:21:50,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {3189#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume ~__VERIFIER_assert__cond~9 == 0; {3186#false} is VALID [2018-11-14 19:21:50,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2018-11-14 19:21:50,059 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 19:21:50,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:50,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:21:50,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:21:50,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:50,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:21:50,078 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 19:21:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:21:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:21:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:50,079 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-14 19:21:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:50,504 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-14 19:21:50,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:21:50,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:21:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-14 19:21:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-14 19:21:50,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2018-11-14 19:21:50,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:50,588 INFO L225 Difference]: With dead ends: 71 [2018-11-14 19:21:50,588 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 19:21:50,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 19:21:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-14 19:21:50,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:50,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 42 states. [2018-11-14 19:21:50,631 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 42 states. [2018-11-14 19:21:50,632 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 42 states. [2018-11-14 19:21:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:50,634 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:21:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:21:50,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:50,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:50,635 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 69 states. [2018-11-14 19:21:50,635 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 69 states. [2018-11-14 19:21:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:50,636 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:21:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:21:50,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:50,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:50,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:50,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 19:21:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 19:21:50,638 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-11-14 19:21:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:50,638 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 19:21:50,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:21:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 19:21:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:21:50,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:50,639 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 19:21:50,640 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:50,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-11-14 19:21:50,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:50,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:50,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:50,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:50,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:50,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {3470#true} call ULTIMATE.init(); {3470#true} is VALID [2018-11-14 19:21:50,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {3470#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3470#true} is VALID [2018-11-14 19:21:50,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 19:21:50,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3470#true} {3470#true} #139#return; {3470#true} is VALID [2018-11-14 19:21:50,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {3470#true} call #t~ret4 := main(); {3470#true} is VALID [2018-11-14 19:21:50,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {3470#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3470#true} is VALID [2018-11-14 19:21:50,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {3470#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3470#true} is VALID [2018-11-14 19:21:50,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {3470#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3470#true} is VALID [2018-11-14 19:21:50,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {3470#true} assume ~main__i~0 < ~main__len~0; {3470#true} is VALID [2018-11-14 19:21:50,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {3470#true} assume ~main__j~0 < ~main__limit~0; {3470#true} is VALID [2018-11-14 19:21:50,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {3470#true} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3472#(and (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:50,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {3472#(and (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2018-11-14 19:21:50,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {3473#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3474#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-14 19:21:50,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {3474#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {3471#false} is VALID [2018-11-14 19:21:50,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {3471#false} assume !false; {3471#false} is VALID [2018-11-14 19:21:50,735 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 19:21:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:50,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:21:50,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-14 19:21:50,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:50,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:21:50,753 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 19:21:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:21:50,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:21:50,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:21:50,754 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-11-14 19:21:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:51,534 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-14 19:21:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:21:51,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-14 19:21:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-14 19:21:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:21:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-14 19:21:51,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-14 19:21:51,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:51,916 INFO L225 Difference]: With dead ends: 69 [2018-11-14 19:21:51,916 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 19:21:51,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 19:21:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-11-14 19:21:51,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:51,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 40 states. [2018-11-14 19:21:51,960 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 40 states. [2018-11-14 19:21:51,960 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 40 states. [2018-11-14 19:21:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:51,963 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 19:21:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 19:21:51,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:51,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:51,963 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 67 states. [2018-11-14 19:21:51,963 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 67 states. [2018-11-14 19:21:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:51,965 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 19:21:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 19:21:51,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:51,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:51,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:51,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 19:21:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 19:21:51,967 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2018-11-14 19:21:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:51,967 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 19:21:51,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:21:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 19:21:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:21:51,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:51,968 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 19:21:51,969 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:51,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-11-14 19:21:51,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:51,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:52,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2018-11-14 19:21:52,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {3744#true} ~__return_main~0 := 0;~__return_334~0 := 0; {3744#true} is VALID [2018-11-14 19:21:52,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2018-11-14 19:21:52,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #139#return; {3744#true} is VALID [2018-11-14 19:21:52,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2018-11-14 19:21:52,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {3744#true} is VALID [2018-11-14 19:21:52,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {3744#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {3746#(<= 0 main_~main__i~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3747#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:52,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {3747#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3746#(<= 0 main_~main__i~0)} is VALID [2018-11-14 19:21:52,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {3746#(<= 0 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3748#(<= 1 main_~main__i~0)} is VALID [2018-11-14 19:21:52,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {3748#(<= 1 main_~main__i~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {3749#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-14 19:21:52,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {3749#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume ~__VERIFIER_assert__cond~11 == 0; {3745#false} is VALID [2018-11-14 19:21:52,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2018-11-14 19:21:52,411 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 19:21:52,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:52,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:52,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:21:52,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:52,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:52,433 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 19:21:52,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:52,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:52,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:52,435 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-14 19:21:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:53,097 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-14 19:21:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:21:53,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 19:21:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-14 19:21:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-14 19:21:53,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2018-11-14 19:21:53,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:53,220 INFO L225 Difference]: With dead ends: 89 [2018-11-14 19:21:53,220 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 19:21:53,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:21:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 19:21:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 38. [2018-11-14 19:21:53,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:53,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 38 states. [2018-11-14 19:21:53,282 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 38 states. [2018-11-14 19:21:53,282 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 38 states. [2018-11-14 19:21:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:53,284 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-14 19:21:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-14 19:21:53,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:53,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:53,285 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 87 states. [2018-11-14 19:21:53,285 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 87 states. [2018-11-14 19:21:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:53,287 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-14 19:21:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-14 19:21:53,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:53,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:53,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:53,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:21:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 19:21:53,289 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2018-11-14 19:21:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:53,289 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 19:21:53,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 19:21:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:21:53,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:53,290 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 19:21:53,291 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:53,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-11-14 19:21:53,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:53,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2018-11-14 19:21:53,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {4085#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4085#true} is VALID [2018-11-14 19:21:53,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2018-11-14 19:21:53,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #139#return; {4085#true} is VALID [2018-11-14 19:21:53,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret4 := main(); {4085#true} is VALID [2018-11-14 19:21:53,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {4085#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4085#true} is VALID [2018-11-14 19:21:53,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {4085#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {4087#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4089#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:53,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {4089#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {4088#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:53,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {4090#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~11 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4091#(not (= 0 main_~__VERIFIER_assert__cond~12))} is VALID [2018-11-14 19:21:53,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {4091#(not (= 0 main_~__VERIFIER_assert__cond~12))} assume ~__VERIFIER_assert__cond~12 == 0; {4086#false} is VALID [2018-11-14 19:21:53,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2018-11-14 19:21:53,565 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 19:21:53,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:53,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:21:53,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 19:21:53,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:53,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:21:53,603 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 19:21:53,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:21:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:21:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:21:53,604 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-14 19:21:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:54,707 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-14 19:21:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:21:54,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-14 19:21:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:21:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-14 19:21:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:21:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-14 19:21:54,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2018-11-14 19:21:55,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:55,193 INFO L225 Difference]: With dead ends: 72 [2018-11-14 19:21:55,193 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 19:21:55,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:21:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 19:21:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2018-11-14 19:21:55,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:55,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 36 states. [2018-11-14 19:21:55,298 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 36 states. [2018-11-14 19:21:55,298 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 36 states. [2018-11-14 19:21:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:55,300 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-14 19:21:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-14 19:21:55,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:55,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:55,301 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 70 states. [2018-11-14 19:21:55,301 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 70 states. [2018-11-14 19:21:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:55,302 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-14 19:21:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-14 19:21:55,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:55,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:55,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:55,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:21:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-14 19:21:55,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-11-14 19:21:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:55,304 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-14 19:21:55,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:21:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 19:21:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:21:55,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:55,305 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 19:21:55,306 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:55,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-11-14 19:21:55,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:55,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:55,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:55,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-14 19:21:55,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4381#true} is VALID [2018-11-14 19:21:55,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-14 19:21:55,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #139#return; {4381#true} is VALID [2018-11-14 19:21:55,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret4 := main(); {4381#true} is VALID [2018-11-14 19:21:55,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4381#true} is VALID [2018-11-14 19:21:55,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {4381#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4381#true} is VALID [2018-11-14 19:21:55,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {4381#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {4383#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {4383#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {4383#(<= 0 main_~main__j~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4384#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:55,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__j~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4383#(<= 0 main_~main__j~0)} is VALID [2018-11-14 19:21:55,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {4383#(<= 0 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-14 19:21:55,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-14 19:21:55,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~11 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4385#(<= 1 main_~main__j~0)} is VALID [2018-11-14 19:21:55,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#(<= 1 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4386#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 19:21:55,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {4386#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume ~__VERIFIER_assert__cond~13 == 0; {4382#false} is VALID [2018-11-14 19:21:55,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-14 19:21:55,434 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 19:21:55,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:55,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:55,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 19:21:55,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:55,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:55,456 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 19:21:55,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:55,457 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-14 19:21:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:56,328 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-14 19:21:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:21:56,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 19:21:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-14 19:21:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:21:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-14 19:21:56,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 124 transitions. [2018-11-14 19:21:56,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:56,525 INFO L225 Difference]: With dead ends: 105 [2018-11-14 19:21:56,525 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 19:21:56,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:21:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 19:21:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 34. [2018-11-14 19:21:56,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:56,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 34 states. [2018-11-14 19:21:56,651 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 34 states. [2018-11-14 19:21:56,651 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 34 states. [2018-11-14 19:21:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:56,656 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 19:21:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 19:21:56,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:56,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:56,657 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 103 states. [2018-11-14 19:21:56,657 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 103 states. [2018-11-14 19:21:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:56,660 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 19:21:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 19:21:56,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:56,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:56,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:56,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:21:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 19:21:56,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-14 19:21:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:56,663 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 19:21:56,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:21:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 19:21:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 19:21:56,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:56,664 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 19:21:56,665 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-11-14 19:21:56,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:56,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:57,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {4771#true} call ULTIMATE.init(); {4771#true} is VALID [2018-11-14 19:21:57,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {4771#true} ~__return_main~0 := 0;~__return_334~0 := 0; {4771#true} is VALID [2018-11-14 19:21:57,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {4771#true} assume true; {4771#true} is VALID [2018-11-14 19:21:57,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4771#true} {4771#true} #139#return; {4771#true} is VALID [2018-11-14 19:21:57,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {4771#true} call #t~ret4 := main(); {4771#true} is VALID [2018-11-14 19:21:57,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {4771#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {4771#true} is VALID [2018-11-14 19:21:57,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {4771#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {4773#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4775#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 19:21:57,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {4775#(and (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {4774#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~11 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2018-11-14 19:21:57,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {4776#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {4777#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-14 19:21:57,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {4777#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume ~__VERIFIER_assert__cond~14 == 0; {4772#false} is VALID [2018-11-14 19:21:57,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {4772#false} assume !false; {4772#false} is VALID [2018-11-14 19:21:57,230 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 19:21:57,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:57,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:21:57,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 19:21:57,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:57,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:21:57,256 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 19:21:57,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:21:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:21:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:21:57,257 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-14 19:21:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:58,292 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-14 19:21:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:21:58,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 19:21:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:21:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 19:21:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:21:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 19:21:58,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-14 19:21:58,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:58,879 INFO L225 Difference]: With dead ends: 70 [2018-11-14 19:21:58,879 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 19:21:58,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:21:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 19:21:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2018-11-14 19:21:59,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:59,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 32 states. [2018-11-14 19:21:59,221 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 32 states. [2018-11-14 19:21:59,221 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 32 states. [2018-11-14 19:21:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:59,223 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-14 19:21:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-14 19:21:59,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:59,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:59,224 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 68 states. [2018-11-14 19:21:59,224 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 68 states. [2018-11-14 19:21:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:59,226 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-14 19:21:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-14 19:21:59,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:59,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:59,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:59,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:21:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-14 19:21:59,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-11-14 19:21:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:59,228 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-14 19:21:59,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:21:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 19:21:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:21:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:59,229 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 19:21:59,230 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:59,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-11-14 19:21:59,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:59,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:59,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 19:21:59,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} ~__return_main~0 := 0;~__return_334~0 := 0; {5057#true} is VALID [2018-11-14 19:21:59,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 19:21:59,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #139#return; {5057#true} is VALID [2018-11-14 19:21:59,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret4 := main(); {5057#true} is VALID [2018-11-14 19:21:59,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__bufsize~0 := #t~nondet1;havoc #t~nondet1; {5057#true} is VALID [2018-11-14 19:21:59,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__len~0 := #t~nondet2;havoc #t~nondet2;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5057#true} is VALID [2018-11-14 19:21:59,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5057#true} is VALID [2018-11-14 19:21:59,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} assume ~main__i~0 < ~main__len~0; {5057#true} is VALID [2018-11-14 19:21:59,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume ~main__j~0 < ~main__limit~0; {5057#true} is VALID [2018-11-14 19:21:59,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume ~main__i~0 + 1 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 + 1 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5059#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:21:59,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {5059#(= main_~__VERIFIER_assert__cond~0 1)} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5057#true} is VALID [2018-11-14 19:21:59,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~1 == 0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5057#true} is VALID [2018-11-14 19:21:59,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5057#true} is VALID [2018-11-14 19:21:59,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5057#true} is VALID [2018-11-14 19:21:59,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~7 == 0);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5057#true} is VALID [2018-11-14 19:21:59,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5057#true} is VALID [2018-11-14 19:21:59,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~9 == 0);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5057#true} is VALID [2018-11-14 19:21:59,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5057#true} is VALID [2018-11-14 19:21:59,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~11 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5057#true} is VALID [2018-11-14 19:21:59,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {5060#(or (= 0 main_~__VERIFIER_assert__cond~13) (<= 0 main_~main__j~0))} is VALID [2018-11-14 19:21:59,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {5060#(or (= 0 main_~__VERIFIER_assert__cond~13) (<= 0 main_~main__j~0))} assume !(~__VERIFIER_assert__cond~13 == 0);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := ~main__j~0 + 1;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := ~main__i~0 + 1;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {5061#(<= 1 main_~main__j~0)} is VALID [2018-11-14 19:21:59,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {5061#(<= 1 main_~main__j~0)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {5062#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-14 19:21:59,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {5062#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume ~__VERIFIER_assert__cond~15 == 0; {5058#false} is VALID [2018-11-14 19:21:59,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 19:21:59,505 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 19:21:59,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:21:59,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:21:59,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 19:21:59,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:59,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:21:59,529 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 19:21:59,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:21:59,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:21:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:21:59,530 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-14 19:22:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:00,159 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-14 19:22:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:00,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 19:22:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-14 19:22:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2018-11-14 19:22:00,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2018-11-14 19:22:00,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:00,271 INFO L225 Difference]: With dead ends: 85 [2018-11-14 19:22:00,271 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:22:00,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:22:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:22:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:22:00,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:00,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:00,273 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:00,273 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:00,273 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:00,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:00,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:00,273 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:00,274 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:00,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:00,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:00,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:00,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:00,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:22:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:22:00,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-14 19:22:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:00,275 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:22:00,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:00,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:00,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:22:00,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:00,486 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2018-11-14 19:22:00,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:00,650 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 94 [2018-11-14 19:22:00,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:00,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:00,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:00,824 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 86 [2018-11-14 19:22:01,871 WARN L179 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-14 19:22:02,311 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-11-14 19:22:02,695 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 18 [2018-11-14 19:22:02,702 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:02,702 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:02,702 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:02,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:02,703 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:22:02,703 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:02,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:02,703 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-11-14 19:22:02,703 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-11-14 19:22:02,703 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2018-11-14 19:22:02,704 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-11-14 19:22:02,704 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-11-14 19:22:02,704 INFO L421 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse3 .cse2)))))) (or (and .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~14))) (and (and .cse0 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2018-11-14 19:22:02,704 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-14 19:22:02,705 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-11-14 19:22:02,706 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-11-14 19:22:02,707 INFO L421 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-14 19:22:02,708 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L421 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-14 19:22:02,709 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-11-14 19:22:02,711 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:02,712 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:02,718 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:02,719 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:22:02,719 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 19:22:02,720 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-14 19:22:02,721 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-14 19:22:02,722 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 19:22:02,723 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L198 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 19:22:02,724 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2018-11-14 19:22:02,725 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2018-11-14 19:22:02,726 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 19:22:02,726 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2018-11-14 19:22:02,726 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 19:22:02,726 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2018-11-14 19:22:02,726 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:22:02,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:22:02 BoogieIcfgContainer [2018-11-14 19:22:02,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:22:02,740 INFO L168 Benchmark]: Toolchain (without parser) took 25670.31 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -326.3 MB). Peak memory consumption was 765.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:02,741 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:02,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:02,742 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:02,743 INFO L168 Benchmark]: RCFGBuilder took 1231.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:02,744 INFO L168 Benchmark]: TraceAbstraction took 23983.69 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 358.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 397.0 MB). Peak memory consumption was 755.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:02,747 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1231.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23983.69 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 358.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 397.0 MB). Peak memory consumption was 755.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && !(0 == __VERIFIER_assert__cond)) || ((main__limit + 4 <= main__bufsize && main__i < main__len && 0 <= main__i) && 0 <= main__j)) || ((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 23.8s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 1594 SDslu, 1143 SDs, 0 SdLazy, 1202 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 23 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1474945965 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1237784 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...