java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 03:58:58,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 03:58:58,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 03:58:58,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 03:58:58,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 03:58:58,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 03:58:58,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 03:58:58,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 03:58:58,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 03:58:58,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 03:58:58,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 03:58:58,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 03:58:58,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 03:58:58,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 03:58:58,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 03:58:58,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 03:58:58,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 03:58:58,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 03:58:58,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 03:58:58,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 03:58:58,317 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 03:58:58,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 03:58:58,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 03:58:58,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 03:58:58,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 03:58:58,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 03:58:58,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 03:58:58,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 03:58:58,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 03:58:58,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 03:58:58,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 03:58:58,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 03:58:58,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 03:58:58,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 03:58:58,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 03:58:58,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 03:58:58,332 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 03:58:58,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 03:58:58,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 03:58:58,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 03:58:58,364 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 03:58:58,364 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 03:58:58,365 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 03:58:58,365 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 03:58:58,365 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 03:58:58,365 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 03:58:58,365 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 03:58:58,366 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 03:58:58,366 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 03:58:58,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 03:58:58,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 03:58:58,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 03:58:58,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 03:58:58,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 03:58:58,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 03:58:58,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 03:58:58,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 03:58:58,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 03:58:58,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 03:58:58,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 03:58:58,369 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 03:58:58,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 03:58:58,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 03:58:58,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 03:58:58,370 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 03:58:58,370 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 03:58:58,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 03:58:58,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 03:58:58,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 03:58:58,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 03:58:58,436 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 03:58:58,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-10-27 03:58:58,507 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac300cb48/151a5fa68866404ba6d79ce7b6cd9f32/FLAGf094689ca [2018-10-27 03:58:59,258 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 03:58:59,259 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-10-27 03:58:59,297 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac300cb48/151a5fa68866404ba6d79ce7b6cd9f32/FLAGf094689ca [2018-10-27 03:58:59,316 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac300cb48/151a5fa68866404ba6d79ce7b6cd9f32 [2018-10-27 03:58:59,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 03:58:59,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 03:58:59,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 03:58:59,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 03:58:59,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 03:58:59,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:58:59" (1/1) ... [2018-10-27 03:58:59,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19989c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:59, skipping insertion in model container [2018-10-27 03:58:59,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:58:59" (1/1) ... [2018-10-27 03:58:59,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 03:58:59,488 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 03:59:00,287 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:59:00,293 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 03:59:00,610 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:59:00,627 INFO L193 MainTranslator]: Completed translation [2018-10-27 03:59:00,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00 WrapperNode [2018-10-27 03:59:00,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 03:59:00,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 03:59:00,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 03:59:00,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 03:59:00,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 03:59:00,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 03:59:00,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 03:59:00,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 03:59:00,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:00,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:01,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... [2018-10-27 03:59:01,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 03:59:01,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 03:59:01,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 03:59:01,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 03:59:01,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 03:59:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 03:59:01,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 03:59:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 03:59:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 03:59:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 03:59:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 03:59:05,931 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 03:59:05,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:59:05 BoogieIcfgContainer [2018-10-27 03:59:05,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 03:59:05,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 03:59:05,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 03:59:05,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 03:59:05,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:58:59" (1/3) ... [2018-10-27 03:59:05,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcc353d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:59:05, skipping insertion in model container [2018-10-27 03:59:05,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:59:00" (2/3) ... [2018-10-27 03:59:05,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcc353d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:59:05, skipping insertion in model container [2018-10-27 03:59:05,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:59:05" (3/3) ... [2018-10-27 03:59:05,941 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-10-27 03:59:05,951 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 03:59:05,960 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 03:59:05,978 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 03:59:06,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 03:59:06,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 03:59:06,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 03:59:06,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 03:59:06,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 03:59:06,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 03:59:06,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 03:59:06,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 03:59:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2018-10-27 03:59:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 03:59:06,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:06,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:06,059 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:06,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1668338331, now seen corresponding path program 1 times [2018-10-27 03:59:06,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:06,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:06,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 03:59:06,235 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:06,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 03:59:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 03:59:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 03:59:06,259 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 2 states. [2018-10-27 03:59:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:06,329 INFO L93 Difference]: Finished difference Result 469 states and 916 transitions. [2018-10-27 03:59:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 03:59:06,335 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-27 03:59:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:06,355 INFO L225 Difference]: With dead ends: 469 [2018-10-27 03:59:06,355 INFO L226 Difference]: Without dead ends: 228 [2018-10-27 03:59:06,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 03:59:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-27 03:59:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-10-27 03:59:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-27 03:59:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 397 transitions. [2018-10-27 03:59:06,424 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 397 transitions. Word has length 13 [2018-10-27 03:59:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:06,424 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 397 transitions. [2018-10-27 03:59:06,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 03:59:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 397 transitions. [2018-10-27 03:59:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 03:59:06,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:06,426 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:06,427 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:06,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 711347229, now seen corresponding path program 1 times [2018-10-27 03:59:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:06,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:06,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:06,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:06,523 INFO L87 Difference]: Start difference. First operand 228 states and 397 transitions. Second operand 3 states. [2018-10-27 03:59:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:07,018 INFO L93 Difference]: Finished difference Result 453 states and 792 transitions. [2018-10-27 03:59:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 03:59:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:07,023 INFO L225 Difference]: With dead ends: 453 [2018-10-27 03:59:07,023 INFO L226 Difference]: Without dead ends: 231 [2018-10-27 03:59:07,026 INFO L605 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-10-27 03:59:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-27 03:59:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-27 03:59:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-27 03:59:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 400 transitions. [2018-10-27 03:59:07,050 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 400 transitions. Word has length 14 [2018-10-27 03:59:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:07,050 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 400 transitions. [2018-10-27 03:59:07,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 400 transitions. [2018-10-27 03:59:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 03:59:07,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:07,052 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:07,052 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:07,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash 52853054, now seen corresponding path program 1 times [2018-10-27 03:59:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:07,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:07,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:07,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:07,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:07,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:07,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:07,163 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:07,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:07,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:07,164 INFO L87 Difference]: Start difference. First operand 231 states and 400 transitions. Second operand 3 states. [2018-10-27 03:59:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:07,529 INFO L93 Difference]: Finished difference Result 440 states and 773 transitions. [2018-10-27 03:59:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:07,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-27 03:59:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:07,532 INFO L225 Difference]: With dead ends: 440 [2018-10-27 03:59:07,532 INFO L226 Difference]: Without dead ends: 216 [2018-10-27 03:59:07,534 INFO L605 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-10-27 03:59:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-27 03:59:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-10-27 03:59:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-27 03:59:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-10-27 03:59:07,554 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 19 [2018-10-27 03:59:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:07,555 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-10-27 03:59:07,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-10-27 03:59:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 03:59:07,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:07,557 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:07,557 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:07,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1603196506, now seen corresponding path program 1 times [2018-10-27 03:59:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:07,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:07,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:07,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:07,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:07,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:07,624 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-10-27 03:59:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:08,515 INFO L93 Difference]: Finished difference Result 618 states and 1102 transitions. [2018-10-27 03:59:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:08,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 03:59:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:08,519 INFO L225 Difference]: With dead ends: 618 [2018-10-27 03:59:08,519 INFO L226 Difference]: Without dead ends: 410 [2018-10-27 03:59:08,520 INFO L605 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-10-27 03:59:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-27 03:59:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2018-10-27 03:59:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-27 03:59:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 722 transitions. [2018-10-27 03:59:08,538 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 722 transitions. Word has length 22 [2018-10-27 03:59:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:08,538 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 722 transitions. [2018-10-27 03:59:08,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 722 transitions. [2018-10-27 03:59:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 03:59:08,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:08,540 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:08,540 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:08,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 760217116, now seen corresponding path program 1 times [2018-10-27 03:59:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:08,543 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:08,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:08,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:08,620 INFO L87 Difference]: Start difference. First operand 404 states and 722 transitions. Second operand 3 states. [2018-10-27 03:59:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:08,891 INFO L93 Difference]: Finished difference Result 640 states and 1134 transitions. [2018-10-27 03:59:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:08,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 03:59:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:08,895 INFO L225 Difference]: With dead ends: 640 [2018-10-27 03:59:08,895 INFO L226 Difference]: Without dead ends: 248 [2018-10-27 03:59:08,897 INFO L605 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-10-27 03:59:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-27 03:59:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-27 03:59:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-27 03:59:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 422 transitions. [2018-10-27 03:59:08,906 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 422 transitions. Word has length 23 [2018-10-27 03:59:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:08,906 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 422 transitions. [2018-10-27 03:59:08,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 422 transitions. [2018-10-27 03:59:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 03:59:08,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:08,907 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:08,908 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:08,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1829095765, now seen corresponding path program 1 times [2018-10-27 03:59:08,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:08,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:09,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:09,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:09,007 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:09,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:09,008 INFO L87 Difference]: Start difference. First operand 246 states and 422 transitions. Second operand 3 states. [2018-10-27 03:59:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:09,318 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2018-10-27 03:59:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:09,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 03:59:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:09,321 INFO L225 Difference]: With dead ends: 248 [2018-10-27 03:59:09,321 INFO L226 Difference]: Without dead ends: 246 [2018-10-27 03:59:09,321 INFO L605 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-10-27 03:59:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-27 03:59:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-10-27 03:59:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-27 03:59:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 414 transitions. [2018-10-27 03:59:09,330 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 414 transitions. Word has length 23 [2018-10-27 03:59:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:09,331 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 414 transitions. [2018-10-27 03:59:09,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 414 transitions. [2018-10-27 03:59:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 03:59:09,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:09,332 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:09,332 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:09,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash -939444677, now seen corresponding path program 1 times [2018-10-27 03:59:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:09,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:09,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:09,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:09,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:09,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:09,503 INFO L87 Difference]: Start difference. First operand 246 states and 414 transitions. Second operand 3 states. [2018-10-27 03:59:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:11,281 INFO L93 Difference]: Finished difference Result 653 states and 1108 transitions. [2018-10-27 03:59:11,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:11,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-27 03:59:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:11,284 INFO L225 Difference]: With dead ends: 653 [2018-10-27 03:59:11,284 INFO L226 Difference]: Without dead ends: 415 [2018-10-27 03:59:11,285 INFO L605 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-10-27 03:59:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-27 03:59:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 402. [2018-10-27 03:59:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-27 03:59:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 614 transitions. [2018-10-27 03:59:11,299 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 614 transitions. Word has length 26 [2018-10-27 03:59:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:11,299 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 614 transitions. [2018-10-27 03:59:11,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 614 transitions. [2018-10-27 03:59:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 03:59:11,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:11,301 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:11,302 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:11,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1536756137, now seen corresponding path program 1 times [2018-10-27 03:59:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 03:59:11,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:11,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:11,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:11,371 INFO L87 Difference]: Start difference. First operand 402 states and 614 transitions. Second operand 3 states. [2018-10-27 03:59:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:11,550 INFO L93 Difference]: Finished difference Result 733 states and 1129 transitions. [2018-10-27 03:59:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-27 03:59:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:11,553 INFO L225 Difference]: With dead ends: 733 [2018-10-27 03:59:11,553 INFO L226 Difference]: Without dead ends: 343 [2018-10-27 03:59:11,554 INFO L605 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-10-27 03:59:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-27 03:59:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-27 03:59:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-27 03:59:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2018-10-27 03:59:11,565 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 36 [2018-10-27 03:59:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:11,566 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2018-10-27 03:59:11,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2018-10-27 03:59:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 03:59:11,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:11,568 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:11,568 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:11,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1299434323, now seen corresponding path program 1 times [2018-10-27 03:59:11,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:11,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:11,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 03:59:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:11,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:11,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:11,630 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand 3 states. [2018-10-27 03:59:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:11,830 INFO L93 Difference]: Finished difference Result 668 states and 1033 transitions. [2018-10-27 03:59:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:11,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-27 03:59:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:11,833 INFO L225 Difference]: With dead ends: 668 [2018-10-27 03:59:11,833 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 03:59:11,834 INFO L605 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-10-27 03:59:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 03:59:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-10-27 03:59:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 03:59:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2018-10-27 03:59:11,844 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 37 [2018-10-27 03:59:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:11,844 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2018-10-27 03:59:11,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2018-10-27 03:59:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 03:59:11,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:11,846 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:11,846 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:11,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 778733261, now seen corresponding path program 1 times [2018-10-27 03:59:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:11,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 03:59:11,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:11,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 03:59:11,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:11,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 03:59:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 03:59:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 03:59:11,922 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand 4 states. [2018-10-27 03:59:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:12,494 INFO L93 Difference]: Finished difference Result 380 states and 547 transitions. [2018-10-27 03:59:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:12,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-27 03:59:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:12,497 INFO L225 Difference]: With dead ends: 380 [2018-10-27 03:59:12,497 INFO L226 Difference]: Without dead ends: 343 [2018-10-27 03:59:12,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 03:59:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-27 03:59:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2018-10-27 03:59:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 03:59:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2018-10-27 03:59:12,509 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 41 [2018-10-27 03:59:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:12,509 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2018-10-27 03:59:12,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 03:59:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2018-10-27 03:59:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 03:59:12,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:12,510 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:12,511 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:12,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 844917860, now seen corresponding path program 1 times [2018-10-27 03:59:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 03:59:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:12,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:12,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:12,606 INFO L87 Difference]: Start difference. First operand 337 states and 470 transitions. Second operand 3 states. [2018-10-27 03:59:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:12,722 INFO L93 Difference]: Finished difference Result 639 states and 892 transitions. [2018-10-27 03:59:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:12,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-27 03:59:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:12,726 INFO L225 Difference]: With dead ends: 639 [2018-10-27 03:59:12,726 INFO L226 Difference]: Without dead ends: 314 [2018-10-27 03:59:12,727 INFO L605 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-10-27 03:59:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-27 03:59:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-10-27 03:59:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-27 03:59:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2018-10-27 03:59:12,737 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 42 [2018-10-27 03:59:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:12,738 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2018-10-27 03:59:12,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2018-10-27 03:59:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 03:59:12,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:12,739 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:12,739 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:12,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash -946678595, now seen corresponding path program 1 times [2018-10-27 03:59:12,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:12,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 03:59:12,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:12,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:12,837 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:12,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:12,839 INFO L87 Difference]: Start difference. First operand 314 states and 433 transitions. Second operand 3 states. [2018-10-27 03:59:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:12,915 INFO L93 Difference]: Finished difference Result 478 states and 669 transitions. [2018-10-27 03:59:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:12,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-27 03:59:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:12,916 INFO L225 Difference]: With dead ends: 478 [2018-10-27 03:59:12,916 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 03:59:12,917 INFO L605 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-10-27 03:59:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 03:59:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 03:59:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 03:59:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 03:59:12,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-10-27 03:59:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:12,918 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 03:59:12,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 03:59:12,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 03:59:12,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 03:59:13,472 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-27 03:59:13,515 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 03:59:13,516 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-27 03:59:13,516 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 03:59:13,516 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 03:59:13,516 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 03:59:13,516 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 03:59:13,516 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 03:59:13,516 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 16 1255) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2018-10-27 03:59:13,517 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2018-10-27 03:59:13,518 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2018-10-27 03:59:13,519 INFO L425 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2018-10-27 03:59:13,520 INFO L425 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2018-10-27 03:59:13,521 INFO L421 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2018-10-27 03:59:13,522 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2018-10-27 03:59:13,522 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-10-27 03:59:13,522 INFO L425 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2018-10-27 03:59:13,523 INFO L425 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2018-10-27 03:59:13,523 INFO L425 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2018-10-27 03:59:13,523 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2018-10-27 03:59:13,523 INFO L425 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2018-10-27 03:59:13,523 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2018-10-27 03:59:13,524 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2018-10-27 03:59:13,525 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2018-10-27 03:59:13,526 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2018-10-27 03:59:13,527 INFO L425 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2018-10-27 03:59:13,527 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2018-10-27 03:59:13,527 INFO L421 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse3 (= main_~this_m_conn~0 1)) (.cse0 (= main_~this_m_delta~0 1)) (.cse1 (= main_~this_m_conn~0 0)) (.cse2 (= main_~this_m_conn_data_listener~0 0))) (or (and (= main_~q~0 0) .cse0 .cse1 .cse2) (and (= main_~this_m_conn_data_listener~0 1) .cse3 (= main_~q~0 3) .cse0) (and (<= 4 main_~q~0) .cse3 .cse0 .cse2) (and (= main_~q~0 2) .cse0 .cse1 .cse2))) [2018-10-27 03:59:13,527 INFO L425 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2018-10-27 03:59:13,527 INFO L425 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2018-10-27 03:59:13,528 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2018-10-27 03:59:13,529 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2018-10-27 03:59:13,530 INFO L425 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2018-10-27 03:59:13,531 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2018-10-27 03:59:13,532 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2018-10-27 03:59:13,533 INFO L425 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 16 1255) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2018-10-27 03:59:13,534 INFO L425 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2018-10-27 03:59:13,535 INFO L425 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2018-10-27 03:59:13,536 INFO L425 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2018-10-27 03:59:13,537 INFO L425 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2018-10-27 03:59:13,538 INFO L425 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2018-10-27 03:59:13,539 INFO L425 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2018-10-27 03:59:13,540 INFO L425 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2018-10-27 03:59:13,541 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 16 1255) the Hoare annotation is: true [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2018-10-27 03:59:13,542 INFO L425 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 1250) the Hoare annotation is: (let ((.cse0 (= main_~this_m_delta~0 1)) (.cse1 (= main_~this_m_conn_data_listener~0 0))) (or (and (= main_~q~0 0) .cse0 (= main_~this_m_conn~0 0) .cse1) (and (<= 4 main_~q~0) (= main_~this_m_conn~0 1) .cse0 .cse1))) [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 1250) no Hoare annotation was computed. [2018-10-27 03:59:13,543 INFO L425 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2018-10-27 03:59:13,544 INFO L425 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2018-10-27 03:59:13,545 INFO L425 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2018-10-27 03:59:13,545 INFO L425 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2018-10-27 03:59:13,545 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2018-10-27 03:59:13,545 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2018-10-27 03:59:13,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 03:59:13 BoogieIcfgContainer [2018-10-27 03:59:13,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 03:59:13,563 INFO L168 Benchmark]: Toolchain (without parser) took 14234.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -171.6 MB). Peak memory consumption was 588.1 MB. Max. memory is 7.1 GB. [2018-10-27 03:59:13,564 INFO L168 Benchmark]: CDTParser took 0.21 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-10-27 03:59:13,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1297.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-27 03:59:13,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 03:59:13,566 INFO L168 Benchmark]: Boogie Preprocessor took 330.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -944.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-10-27 03:59:13,567 INFO L168 Benchmark]: RCFGBuilder took 4899.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 216.0 MB). Peak memory consumption was 216.0 MB. Max. memory is 7.1 GB. [2018-10-27 03:59:13,568 INFO L168 Benchmark]: TraceAbstraction took 7629.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 419.5 MB). Peak memory consumption was 419.5 MB. Max. memory is 7.1 GB. [2018-10-27 03:59:13,577 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1297.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 330.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -944.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4899.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 216.0 MB). Peak memory consumption was 216.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7629.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 419.5 MB). Peak memory consumption was 419.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((q == 0 && this_m_delta == 1) && this_m_conn == 0) && this_m_conn_data_listener == 0) || (((this_m_conn_data_listener == 1 && this_m_conn == 1) && q == 3) && this_m_delta == 1)) || (((4 <= q && this_m_conn == 1) && this_m_delta == 1) && this_m_conn_data_listener == 0)) || (((q == 2 && this_m_delta == 1) && this_m_conn == 0) && this_m_conn_data_listener == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q == 0 && this_m_delta == 1) && this_m_conn == 0) && this_m_conn_data_listener == 0) || (((4 <= q && this_m_conn == 1) && this_m_delta == 1) && this_m_conn_data_listener == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 242 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4082 SDtfs, 2122 SDslu, 1809 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 85 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 15057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...